Mechanical response of the tympanal membranes of the tree cricket Oecanthus henryi

Crickets have two tympanal membranes on the tibiae of each foreleg. Among several field cricket species of the genus Gryllus (Gryllinae), the posterior tympanal membrane (PTM) is significantly larger than the anterior membrane (ATM). Laser Doppler vibrometric measurements have shown that the smaller ATM does not respond as much as the PTM to sound. Hence the PTM has been suggested to be the principal tympanal acoustic input to the auditory organ. In tree crickets (Oecanthinae), the ATM is slightly larger than the PTM. Both membranes are structurally complex, presenting a series of transverse folds on their surface, which are more pronounced on the ATM than on the PTM. The mechanical response of both membranes to acoustic stimulation was investigated using microscanning laser Doppler vibrometry. Only a small portion of the membrane surface deflects in response to sound. Both membranes exhibit similar frequency responses, and move out of phase with each other, producing compressions and rarefactions of the tracheal volume backing the tympanum. Therefore, unlike field crickets, tree crickets may have four instead of two functional tympanal membranes. This is interesting in the context of the outstanding question of the role of spiracular inputs in the auditory system of tree crickets.

Domains in complex surfaces with non-compact automorphism groups

Let X be an arbitrary complex surface and D a domain in X that has a non-compact group of holomorphic automorphisms. A characterization of those domains D that admit a smooth, weakly pseudoconvex, finite type boundary orbit accumulation point is obtained.

Synthesis and structural characterization of a new ruthenium hydride ethylene complex

A ruthenium(II) ethylene complex, trans-[Ru(H)(C2H4)- (dppm)(2)][BF4], hearing two 1,1-bis(diphenylphosphino) methane (dppm) ligands has been synthesized and structurally characterized using X-ray crystallography. In the molecular structure, the Ru-II center shows a distorted octahedral coordination geometry formed by four P atoms of the two chelating dppm ligands, a hydride, and an ethylene ligands. The four dppm P atoms are almost co-planar with the hydride and the ethylene ligands perpendicular to this plane. The C-C bond distance of the bound ethylene is 1.375(6) angstrom, which is elongated by 0.042 angstrom as compared to free ethylene (1.333(2) angstrom). The packing diagram of the complex shows two voids or channels, which are occupied by BF4- counterion and water molecules.

Edge-based connected component approach for skew correction of complex document images

Skew correction of complex document images is a difficult task. We propose an edge-based connected component approach for robust skew correction of documents with complex layout and content. The algorithm essentially consists of two steps - an 'initialization' step to determine the image orientation from the centroids of the connected components and a 'search' step to find the actual skew of the image. During initialization, we choose two different sets of points regularly spaced across the the image, one from the left to right and the other from top to bottom. The image orientation is determined from the slope between the two succesive nearest neighbors of each of the points in the chosen set. The search step finds succesive nearest neighbors that satisfy the parameters obtained in the initialization step. The final skew is determined from the slopes obtained in the 'search' step. Unlike other connected component based methods, the proposed method does not require any binarization step that generally precedes connected component analysis. The method works well for scanned documents with complex layout of any skew with a precision of 0.5 degrees.

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.

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.

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.

PVA-PSSA Membrane with Interpenetrating Networks and its Methanol Crossover Mitigating Effect in DMFCs

A membrane with interpenetrating networks between poly(vinyl alcohol) (PVA) and poly(styrene sulfonic acid) (PSSA) coupled with a high proton conductivity is realized and evaluated as a proton exchange membrane electrolyte for a direct methanol fuel cell (DMFC). Its reduced methanol permeability and improved performance in DMFCs suggest the new blend as an alternative membrane to Nafion membranes. The membrane has been characterized by powder X-ray diffraction, scanning electron microscopy, time-modulated differential scanning calorimetry, and thermogravimetric analysis in conjunction with its mechanical strength. The maximum proton conductivity of 3.3×10−2 S/cm for the PVA–PSSA blend membrane is observed at 373 K. From nuclear magnetic resonance imaging and volume localized spectroscopy experiments, the PVA–PSSA membrane has been found to exhibit a promising methanol impermeability, in DMFCs. On evaluating its utility in a DMFC, it has been found that a peak power density of 90 mW/cm2 at a load current density of 320 mA/cm2 is achieved with the PVA–PSSA membrane compared to a peak power density of 75 mW/cm2 at a load current density of 250 mA/cm2 achievable for a DMFC employing Nafion membrane electrolyte while operating under identical conditions; this is attributed primarily to the methanol crossover mitigating property of the PVA–PSSA membrane.

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.

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.

Role of Magmas in protein transport and human mitochondria biogenesis

Magmas, a conserved mammalian protein essential for eukaryotic development, is overexpressed in prostate carcinomas and cells exposed to granulocyte-macrophage colony-stimulating factor (GM-CSF). Reduced Magmas expression resulted in decreased proliferative rates in cultured cells. However, the cellular function of Magmas is still elusive. In this report, we have showed that human Magmas is an ortholog of Saccharomyces cerevisiae Pam16 having similar functions and is critical for protein translocation across mitochondrial inner membrane. Human Magmas shows a complete growth complementation of delta pam16 yeast cells at all temperatures. On the basis of our analysis, we report that Magmas localizes into mitochondria and is peripherally associated with inner mitochondrial membrane in yeast and humans. Magmas forms a stable subcomplex with J-protein Pam18 or DnaJC19 through its C-terminal region and is tethered to TIM23 complex of yeast and humans. Importantly, amino acid alterations in Magmas leads to reduced stability of the subcomplex with Pam18 that results in temperature sensitivity and in vivo protein translocation defects in yeast cells. These observations highlight the central role of Magmas in protein import and mitochondria biogenesis. In humans, absence of a functional DnaJC19 leads to dilated cardiac myophathic syndrome (DCM), a genetic disorder with characteristic features of cardiac myophathy and neurodegeneration. We propose that the mutations resulting in decreased stability of functional Magmas:DnaJC19 subcomplex at human TIM23 channel leads to impaired protein import and cellular respiration in DCM patients. Together, we propose a model showing how Magmas:DnaJC19 subcomplex is associated with TIM23 complex and thus regulates mitochondrial import process.

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.

BER analysis of space-time block codes from generalized complex orthogonal designs for M-PSK

In this paper, we present an analysis for the bit error rate (BER) performance of space-time block codes (STBC) from generalized complex orthogonal designs for M-PSK modulation. In STBCs from complex orthogonal designs (COD), the norms of the column vectors are the same (e.g., Alamouti code). However, in generalized COD (GCOD), the norms of the column vectors may not necessarily be the same (e.g., the rate-3/5 and rate-7/11 codes by Su and Xia in [1]). STBCs from GCOD are of interest because of the high rates that they can achieve (in [2], it has been shown that the maximum achievable rate for STBCs from GCOD is bounded by 4/5). While the BER performance of STBCs: from COD (e.g., Alamouti code) can be simply obtained from existing analytical expressions for receive diversity with the same diversity order by appropriately scaling the SNR, this can not be done for STBCs from GCOD (because of the unequal norms of the column vectors). Our contribution in this paper is that we derive analytical expressions for the BER performance of any STBC from GCOD. Our BER analysis for the GCOD captures the performance of STBCs from COD as special cases. We validate our results with two STBCs from GCOD reported by Su and Xia in [1], for 5 and 6 transmit antennas (G(5) and G(6) in [1]) with rates 7/11 and 3/5, respectively.