Coding behavioural data for cladistic analysis: using dynamic homology without parsimony

Many of the controversies around the concept of homology rest on the subjectivity inherent to primary homology propositions. Dynamic homology partially solves this problem, but there has been up to now scant application of it outside of the molecular domain. This is probably because morphological and behavioural characters are rich in properties, connections and qualities, so that there is less space for conflicting character delimitations. Here we present a new method for the direct optimization of behavioural data, a method that relies on the richness of this database to delimit the characters, and on dynamic procedures to establish character state identity. We use between-species congruence in the data matrix and topological stability to choose the best cladogram. We test the methodology using sequences of predatory behaviour in a group of spiders that evolved the highly modified predatory technique of spitting glue onto prey. The cladogram recovered is fully compatible with previous analyses in the literature, and thus the method seems consistent. Besides the advantage of enhanced objectivity in character proposition, the new procedure allows the use of complex, context-dependent behavioural characters in an evolutionary framework, an important step towards the practical integration of the evolutionary and ecological perspectives on diversity. (C) The Willi Hennig Society 2010.

The non-coding RNA BC1 is down-regulated in the hippocampus of Wistar Audiogenic Rat (WAR) strain after audiogenic kindling

The aim of this study was to identify molecular pathways involved in audiogenic seizures in the epilepsy-prone Wistar Audiogenic Rat (WAR). For this, we used a suppression-subtractive hybridization (SSH) library from the hippocampus of WARs coupled to microarray comparative gene expression analysis, followed by Northern blot validation of individual genes. We discovered that the levels of the non-protein coding (npc) RNA BC1 were significantly reduced in the hippocampus of WARs submitted to repeated audiogenic seizures (audiogenic kindling) when compared to Wistar resistant rats and to both naive WARs and Wistars. By quantitative in situ hybridization, we verified lower levels of BC1 RNA in the GD-hilus and significant signal ratio reduction in the stratum radiatum and stratum pyramidale of hippocampal CA3 subfield of audiogenic kindled animals. Functional results recently obtained in a BC1-/- mouse model and our current data are supportive of a potential disruption in signaling pathways, upstream of BC1, associated with the seizure susceptibility of WARs. (C) 2010 Elsevier B.V. All rights reserved.

UNIVERSAL COVERING OF DRIFTLESS CONTROL SYSTEMS

Let M be a finite-dimensional manifold and Sigma be a driftless control system on M of full rank. We prove that for a given initial state x epsilon M, the covering space Gamma(Sigma, x) for a monotonic homotopy of trajectories of Sigma which is recently constructed in [1] coincides with the simply connected universal covering manifold of M and that the terminal projection epsilon(x) : Gamma(Sigma, x) -> M given by epsilon(x) ([alpha]) = alpha(1) is a covering mapping.

An imaginary potential with universal normalization for dissipative processes in heavy-ion reactions

In this work we present new coupled channel calculations with the Sao Paulo potential (SPP) as the bare interaction, and an imaginary potential with system and energy independent normalization that has been developed to take into account dissipative processes in heavy-ion reactions. This imaginary potential is based on high-energy nucleon interaction in nuclear medium. Our theoretical predictions for energies up to approximate to 100 MeV/nucleon agree very well with the experimental data for the p, n + nucleus, (16)O + (27)Al, (16)O + (60)Ni, (58)Ni + (124)Sn, and weakly bound projectile (7)Li + (120)Sn systems. (C) 2008 Elsevier B.V. All rights reserved.

Four-level systems and a universal quantum gate

We discuss the possibility of implementing a universal quantum XOR gate by using two coupled quantum dots subject to external magnetic fields that are parallel and slightly different. We consider this system in two different field configurations. In the first case, parallel external fields with the intensity difference at each spin being proportional to the time-dependent interaction between the spins. A general exact solution describing this system is presented and analyzed to adjust field parameters. Then we consider parallel fields with intensity difference at each spin being constant and the interaction between the spins switching on and off adiabatically. In both cases we adjust characteristics of the external fields (their intensities and duration) in order to have the parallel pulse adequate for constructing the XOR gate. In order to provide a complete theoretical description of all the cases, we derive relations between the spin interaction, the inter-dot distance, and the external field. (C) 2008 WILEYNCH Verlag GmbH & Co. KGaA. Weinheim.

Universal trend for heavy-ion total reaction cross-sections at energies above the Coulomb barrier

Heavy-ion total reaction cross-section measurements for more than 1100 reaction cases covering 61 target nuclei in the range (6)Li-(238)U and 158 projectile nuclei from (2)H to (84)Kr (mostly exotic ones) have been analyzed in a systematic way by using an empirical, three-parameter formula that is applicable to the cases of projectile kinetic energies above the Coulomb barrier. The analysis has shown that the average total nuclear binding energy per nucleon of the interacting nuclei and their radii are the chief quantities that describe the cross-section patterns. A great amount of cross-section data (87%) has been quite satisfactorily reproduced by the proposed formula; therefore, the total reaction cross-section predictions for new, not yet experimentally investigated reaction cases can be obtained within 25% (or much less) uncertainty.

Single Synapse Information Coding in Intraburst Spike Patterns of Central Pattern Generator Motor Neurons

Burst firing is ubiquitous in nervous systems and has been intensively studied in central pattern generators (CPGs). Previous works have described subtle intraburst spike patterns (IBSPs) that, despite being traditionally neglected for their lack of relation to CPG motor function, were shown to be cell-type specific and sensitive to CPG connectivity. Here we address this matter by investigating how a bursting motor neuron expresses information about other neurons in the network. We performed experiments on the crustacean stomatogastric pyloric CPG, both in control conditions and interacting in real-time with computer model neurons. The sensitivity of postsynaptic to presynaptic IBSPs was inferred by computing their average mutual information along each neuron burst. We found that details of input patterns are nonlinearly and inhomogeneously coded through a single synapse into the fine IBSPs structure of the postsynaptic neuron following burst. In this way, motor neurons are able to use different time scales to convey two types of information simultaneously: muscle contraction (related to bursting rhythm) and the behavior of other CPG neurons (at a much shorter timescale by using IBSPs as information carriers). Moreover, the analysis revealed that the coding mechanism described takes part in a previously unsuspected information pathway from a CPG motor neuron to a nerve that projects to sensory brain areas, thus providing evidence of the general physiological role of information coding through IBSPs in the regulation of neuronal firing patterns in remote circuits by the CNS.

Recording from Two Neurons: Second-Order Stimulus Reconstruction from Spike Trains and Population Coding

We study the reconstruction of visual stimuli from spike trains, representing the reconstructed stimulus by a Volterra series up to second order. We illustrate this procedure in a prominent example of spiking neurons, recording simultaneously from the two H1 neurons located in the lobula plate of the fly Chrysomya megacephala. The fly views two types of stimuli, corresponding to rotational and translational displacements. Second-order reconstructions require the manipulation of potentially very large matrices, which obstructs the use of this approach when there are many neurons. We avoid the computation and inversion of these matrices using a convenient set of basis functions to expand our variables in. This requires approximating the spike train four-point functions by combinations of two-point functions similar to relations, which would be true for gaussian stochastic processes. In our test case, this approximation does not reduce the quality of the reconstruction. The overall contribution to stimulus reconstruction of the second-order kernels, measured by the mean squared error, is only about 5% of the first-order contribution. Yet at specific stimulus-dependent instants, the addition of second-order kernels represents up to 100% improvement, but only for rotational stimuli. We present a perturbative scheme to facilitate the application of our method to weakly correlated neurons.

Sparse partition universal graphs for graphs of bounded degree

In 1983, Chvatal, Trotter and the two senior authors proved that for any Delta there exists a constant B such that, for any n, any 2-colouring of the edges of the complete graph K(N) with N >= Bn vertices yields a monochromatic copy of any graph H that has n vertices and maximum degree Delta. We prove that the complete graph may be replaced by a sparser graph G that has N vertices and O(N(2-1/Delta)log(1/Delta)N) edges, with N = [B`n] for some constant B` that depends only on Delta. Consequently, the so-called size-Ramsey number of any H with n vertices and maximum degree Delta is O(n(2-1/Delta)log(1/Delta)n) Our approach is based on random graphs; in fact, we show that the classical Erdos-Renyi random graph with the numerical parameters above satisfies a stronger partition property with high probability, namely, that any 2-colouring of its edges contains a monochromatic universal graph for the class of graphs on n vertices and maximum degree Delta. The main tool in our proof is the regularity method, adapted to a suitable sparse setting. The novel ingredient developed here is an embedding strategy that allows one to embed bounded degree graphs of linear order in certain pseudorandom graphs. Crucial to our proof is the fact that regularity is typically inherited at a scale that is much finer than the scale at which it is assumed. (C) 2011 Elsevier Inc. All rights reserved.

Recovery of DNA for the detection and genotyping of human papillomavirus from clinical cervical specimens stored for up to 2 years in a universal collection medium with denaturing reagent

The recovery and stability of DNA for the detection and genotyping of HPV in UCM-containing specimens, after exposure to denaturing reagents and stored for up to 2 years were evaluated. Samples were collected from 60 women who had cervical cytology specimens harboring cervical intraepithelial neoplasia (CIN) 2 or 3. All samples were stored in UCM and had been frozen at -20 degrees C following the addition of the denaturing reagent (sodium hydroxide) and the removal of the aliquot required for Hybrid Capture 2 testing for the identification of HPV DNA. The samples had been stored for 6, 12 and 24 months (20 samples for each storage time). HPV DNA extraction was performed according to a protocol designed specifically and the presence and quality of DNA was confirmed by human P-globin detection using the consensus primers G73 and G74. HPV DNA was amplified using the consensus primers PGMY09 and PGMY11, and reverse line-blot hybridization was used to detect type-specific amplicons for 37 HPV types. The DNA extracted from the denatured specimen was recovered in 57/60 (95%) of the samples. HPV DNA was detected in 56/57 (98%) of the recovered samples. Twenty-six of the 56 samples recovered (48%) were genotyped successfully. (c) 2007 Elsevier B.V. All rights reserved.

Identification of protein-coding and intronic noncoding RNAs down-regulated in clear cell renal carcinoma

The clear cell subtype of renal cell carcinoma (RCC) is the most lethal and prevalent cancer of the urinary system. To investigate the molecular changes associated with malignant transformation in clear cell RCC, the gene expression profiles of matched samples of tumor and adjacent non-neoplastic tissue were obtained from six patients. A custom-built cDNA microarray platform was used, comprising 2292 probes that map to exons of genes and 822 probes for noncoding RNAs mapping to intronic regions. Intronic transcription was detected in all normal and neoplastic renal tissues. A subset of 55 transcripts was significantly down-regulated in clear cell RCC relative to the matched nontumor tissue as determined by a combination of two statistical tests and leave-one-out patient cross-validation. Among the down-regulated transcripts, 49 mapped to untranslated or coding exons and 6 were intronic relative to known exons of protein-coding genes. Lower levels of expression of SIN3B, TRIP3, SYNJ2BP and NDE1 (P<0.02), and of intronic transcripts derived from SND1 and ACTN4 loci (P<0.05), were confirmed in clear cell RCC by Real-time RT-PCR. A subset of 25 transcripts was deregulated in additional six nonclear cell RCC samples, pointing to common transcriptional alterations in RCC irrespective of the histological subtype or differentiation state of the tumor. Our results indicate a novel set of tumor suppressor gene candidates, including noncoding intronic RNAs, which may play a significant role in malignant transformations of normal renal cells. (C) 2008 Wiley-Liss, Inc.

Universal Experimental Measurement System «Sun-Walker» : Automotive measurement system for the evaluation of the solar irradiation distribution for the tests of the solar concentrated systems.

This Thesis project is a part of the research conducted in Solar industry. ABSOLICON Solar Concentrator AB has invented and started production of the prospective solar concentrated system Absolicon X10. The aims of this Thesis project are designing, assembling, calibrating and putting in operation the automatic measurement system intended to evaluate distribution of density of solar radiation in the focal line of the concentrated parabolic reflectors and to measure radiation from the artificial source of light being a calibration-testing tool.On the basis of the requirements of the company’s administration and needs of designing the concentrated reflectors the operation conditions for the Sun-Walker were formulated. As the first step, the complex design of the whole system was made and division on the parts was specified. After the preliminary conducted simulation of the functions and operation conditions of the all parts were formulated.As the next steps, the detailed design of all the parts was made. Most components were ordered from respective companies. Some of the mechanical components were made in the workshop of the company. All parts of the Sun-Walker were assembled and tested. The software part, which controls the Sun-Walker work and conducts measurements of solar irradiation, was created on the LabVIEW basis. To tune and test the software part, the special simulator was designed and assembled.When all parts were assembled in the complete system, the Sun-Walker was tested, calibrated and tuned.

Universal Design in Higher Education

While colleges and universities increasingly draw upon the concept of Universal Design to create an ideal learning environment, it can be challenging to apply the concept practically in the classroom. This project explores innovative ways to incorporate Universal Design into campus architecture, classroom technology and curriculum development. Further, this brief describes different approaches used by universities to garner faculty interest and offer effective training in Universal Design.

Study of the audio coding algorithm of the MPEG-4 AAC standard and comparison among implementations of modules of the algorithm

Audio coding is used to compress digital audio signals, thereby reducing the amount of bits needed to transmit or to store an audio signal. This is useful when network bandwidth or storage capacity is very limited. Audio compression algorithms are based on an encoding and decoding process. In the encoding step, the uncompressed audio signal is transformed into a coded representation, thereby compressing the audio signal. Thereafter, the coded audio signal eventually needs to be restored (e.g. for playing back) through decoding of the coded audio signal. The decoder receives the bitstream and reconverts it into an uncompressed signal. ISO-MPEG is a standard for high-quality, low bit-rate video and audio coding. The audio part of the standard is composed by algorithms for high-quality low-bit-rate audio coding, i.e. algorithms that reduce the original bit-rate, while guaranteeing high quality of the audio signal. The audio coding algorithms consists of MPEG-1 (with three different layers), MPEG-2, MPEG-2 AAC, and MPEG-4. This work presents a study of the MPEG-4 AAC audio coding algorithm. Besides, it presents the implementation of the AAC algorithm on different platforms, and comparisons among implementations. The implementations are in C language, in Assembly of Intel Pentium, in C-language using DSP processor, and in HDL. Since each implementation has its own application niche, each one is valid as a final solution. Moreover, another purpose of this work is the comparison among these implementations, considering estimated costs, execution time, and advantages and disadvantages of each one.