CYTOGENETIC ANALYSIS OF THE BRAZILIAN BLIND CATFISH PIMELODELLA-KRONEI AND ITS PRESUMED ANCESTOR, P-TRANSITORIA

Karyotypes of the blind catfish Pimelodella kronei from three different caves in the southwestern part of the State of São Paulo, Brazil, and of its presumed ancestor Pimelodella transitoria were examined. Chromosome number and formula, as well as C-banding pattern and NOR location were found to be the same in both species, supporting the hypothesis of a close relationship and even conspecificity of P. kronei and P. transitoria.

The history of the Jews, from the taking of Jerusalem by Titus, to the present time, comprising a narrative of their wanderings, persecutions, commercial enterprises, literature, manners, customs, and forms of worship : with an account of the various efforts made for their conversion

[James A. Huie]

Hymn book, for jewish worship

[M. Landsberg ...]

20 hymns for Jewish worship : for solo and chorus, with accompaniment of the organ

composed, arr. and publ. by Fred. E. Kitziger

Musical service for the New Year : according to the union prayer book for jewish worship

by Edward J. Stark

Musical service for the Eve of Atonement : according to the union prayer book for jewish worship

by Edward J. Stark

Musical service for the Day of Atonement : according to the union prayer book for jewish worship

by Edward J. Stark

Music to hymns and anthems for jewish worship by G. Gottheil

composed and selected by A. J. Davis

Efficient local unfolding with ancestor stacks

The most successful unfolding rules used nowadays in the partial evaluation of logic programs are based on well quasi orders (wqo) applied over (covering) ancestors, i.e., a subsequence of the atoms selected during a derivation. Ancestor (sub)sequences are used to increase the specialization power of unfolding while still guaranteeing termination and also to reduce the number of atoms for which the wqo has to be checked. Unfortunately, maintaining the structure of the ancestor relation during unfolding introduces significant overhead. We propose an efficient, practical local unfolding rule based on the notion of covering ancestors which can be used in combination with a wqo and allows a stack-based implementation without losing any opportunities for specialization. Using our technique, certain non-leftmost unfoldings are allowed as long as local unfolding is performed, i.e., we cover depth-first strategies. To deal with practical programs, we propose assertion-based techniques which allow our approach to treat programs that include (Prolog) built-ins and external predicates in a very extensible manner, for the case of leftmost unfolding. Finally, we report on our mplementation of these techniques embedded in a practical partial evaluator, which shows that our techniques, in addition to dealing with practical programs, are also significantly more efficient in time and somewhat more efficient in memory than traditional tree-based implementations. To appear in Theory and Practice of Logic Programming (TPLP).

Efficient local unfolding with ancestor stacks for full prolog

The integration of powerful partial evaluation methods into practical compilers for logic programs is still far from reality. This is related both to 1) efficiency issues and to 2) the complications of dealing with practical programs. Regarding efnciency, the most successful unfolding rules used nowadays are based on structural orders applied over (covering) ancestors, i.e., a subsequence of the atoms selected during a derivation. Unfortunately, maintaining the structure of the ancestor relation during unfolding introduces significant overhead. We propose an efficient, practical local unfolding rule based on the notion of covering ancestors which can be used in combination with any structural order and allows a stack-based implementation without losing any opportunities for specialization. Regarding the second issue, we propose assertion-based techniques which allow our approach to deal with real programs that include (Prolog) built-ins and external predicates in a very extensible manner. Finally, we report on our implementation of these techniques in a practical partial evaluator, embedded in a state of the art compiler which uses global analysis extensively (the Ciao compiler and, specifically, its preprocessor CiaoPP). The performance analysis of the resulting system shows that our techniques, in addition to dealing with practical programs, are also significantly more efficient in time and somewhat more efficient in memory than traditional tree-based implementations.

The universal ancestor

A genetic annealing model for the universal ancestor of all extant life is presented; the name of the model derives from its resemblance to physical annealing. The scenario pictured starts when “genetic temperatures” were very high, cellular entities (progenotes) were very simple, and information processing systems were inaccurate. Initially, both mutation rate and lateral gene transfer levels were elevated. The latter was pandemic and pervasive to the extent that it, not vertical inheritance, defined the evolutionary dynamic. As increasingly complex and precise biological structures and processes evolved, both the mutation rate and the scope and level of lateral gene transfer, i.e., evolutionary temperature, dropped, and the evolutionary dynamic gradually became that characteristic of modern cells. The various subsystems of the cell “crystallized,” i.e., became refractory to lateral gene transfer, at different stages of “cooling,” with the translation apparatus probably crystallizing first. Organismal lineages, and so organisms as we know them, did not exist at these early stages. The universal phylogenetic tree, therefore, is not an organismal tree at its base but gradually becomes one as its peripheral branchings emerge. The universal ancestor is not a discrete entity. It is, rather, a diverse community of cells that survives and evolves as a biological unit. This communal ancestor has a physical history but not a genealogical one. Over time, this ancestor refined into a smaller number of increasingly complex cell types with the ancestors of the three primary groupings of organisms arising as a result.

Paired Ig-like receptor homologs in birds and mammals share a common ancestor with mammalian Fc receptors

Paired Ig-like receptors (PIR) that can reciprocally modulate cellular activation have been described in mammals. In the present study, we searched expressed sequence tag databases for PIR relatives to identify chicken expressed sequence tags predictive of ≈25% amino acid identity to mouse PIR. Rapid amplification of cDNA ends (RACE)-PCR extension of expressed sequence-tag sequences using chicken splenic cDNA as a template yielded two distinct cDNAs, the sequence analysis of which predicted protein products with related extracellular Ig-like domains. Chicken Ig-like receptor (CHIR)-A was characterized by its transmembrane segment with a positively charged histidine residue and short cytoplasmic tail, thereby identifying CHIR-A as a candidate-activating receptor. Conversely, CHIR-B was characterized by its nonpolar transmembrane segment and cytoplasmic tail with two immunoreceptor tyrosine-based inhibitory motifs, indicating that it may serve as an inhibitory receptor. The use of CHIR amino acid sequences in a search for other PIR relatives led to the recognition of mammalian Fc receptors as distantly related genes. Comparative analyses based on amino acid sequences and three-dimensional protein structures provided molecular evidence for common ancestry of the PIR and Fc receptor gene families.