IDRA (IDeal Resource Allocation): Computing ideal speedups in parallel logic programming

We present a technique to estimate accurate speedups for parallel logic programs with relative independence from characteristics of a given implementation or underlying parallel hardware. The proposed technique is based on gathering accurate data describing one execution at run-time, which is fed to a simulator. Alternative schedulings are then simulated and estimates computed for the corresponding speedups. A tool implementing the aforementioned techniques is presented, and its predictions are compared to the performance of real systems, showing good correlation.

Some techniques for automated, resource-aware distributed and mobile computing in a multi-paradigm programming system

Distributed parallel execution systems speed up applications by splitting tasks into processes whose execution is assigned to different receiving nodes in a high-bandwidth network. On the distributing side, a fundamental problem is grouping and scheduling such tasks such that each one involves sufñcient computational cost when compared to the task creation and communication costs and other such practical overheads. On the receiving side, an important issue is to have some assurance of the correctness and characteristics of the code received and also of the kind of load the particular task is going to pose, which can be specified by means of certificates. In this paper we present in a tutorial way a number of general solutions to these problems, and illustrate them through their implementation in the Ciao multi-paradigm language and program development environment. This system includes facilities for parallel and distributed execution, an assertion language for specifying complex programs properties (including safety and resource-related properties), and compile-time and run-time tools for performing automated parallelization and resource control, as well as certification of programs with resource consumption assurances and efñcient checking of such certificates.

Automatic parallelization of irregular and pointer-based computations: perspectives from logic and constraint programming

Irregular computations pose some of the most interesting and challenging problems in automatic parallelization. Irregularity appears in certain kinds of numerical problems and is pervasive in symbolic applications. Such computations often use dynamic data structures which make heavy use of pointers. This complicates all the steps of a parallelizing compiler, from independence detection to task partitioning and placement. In the past decade there has been significant progress in the development of parallelizing compilers for logic programming and, more recently, constraint programming. The typical applications of these paradigms frequently involve irregular computations, which arguably makes the techniques used in these compilers potentially interesting. In this paper we introduce in a tutorial way some of the problems faced by parallelizing compilers for logic and constraint programs. These include the need for inter-procedural pointer aliasing analysis for independence detection and having to manage speculative and irregular computations through task granularity control and dynamic task allocation. We also provide pointers to some of the progress made in these áreas. In the associated talk we demónstrate representatives of several generations of these parallelizing compilers.

The role of computational logic as a hinge paradigm among deduction, problem solving, programming, and parallelism

This paper presents some brief considerations on the role of Computational Logic in the construction of Artificial Intelligence systems and in programming in general. It does not address how the many problems in AI can be solved but, rather more modestly, tries to point out some advantages of Computational Logic as a tool for the AI scientist in his quest. It addresses the interaction between declarative and procedural views of programs (deduction and action), the impact of the intrinsic limitations of logic, the relationship with other apparently competing computational paradigms, and finally discusses implementation-related issues, such as the efficiency of current implementations and their capability for efficiently exploiting existing and future sequential and parallel hardware. The purpose of the discussion is in no way to present Computational Logic as the unique overall vehicle for the development of intelligent systems (in the firm belief that such a panacea is yet to be found) but rather to stress its strengths in providing reasonable solutions to several aspects of the task.

The ciao modular, standalone compiler and its generic program processing library

Ciao Prolog incorporates a module system which allows sepárate compilation and sensible creation of standalone executables. We describe some of the main aspects of the Ciao modular compiler, ciaoc, which takes advantage of the characteristics of the Ciao Prolog module system to automatically perform sepárate and incremental compilation and efficiently build small, standalone executables with competitive run-time performance, ciaoc can also detect statically a larger number of programming errors. We also present a generic code processing library for handling modular programs, which provides an important part of the functionality of ciaoc. This library allows the development of program analysis and transformation tools in a way that is to some extent orthogonal to the details of module system design, and has been used in the implementation of ciaoc and other Ciao system tools. We also describe the different types of executables which can be generated by the Ciao compiler, which offer different tradeoffs between executable size, startup time, and portability, depending, among other factors, on the linking regime used (static, dynamic, lazy, etc.). Finally, we provide experimental data which illustrate these tradeoffs.

CumuloNimbo: A highly-scalable transaction processing platform as a service.

One of the main challenges facing next generation Cloud platform services is the need to simultaneously achieve ease of programming, consistency, and high scalability. Big Data applications have so far focused on batch processing. The next step for Big Data is to move to the online world. This shift will raise the requirements for transactional guarantees. CumuloNimbo is a new EC-funded project led by Universidad Politécnica de Madrid (UPM) that addresses these issues via a highly scalable multi-tier transactional platform as a service (PaaS) that bridges the gap between OLTP and Big Data applications.

KATS: A Knowledge Acquisition Tool Based on Electronic Document Processing

This paper describes a particular knowledge acquisition tool for the construction and maintenance of the knowledge model of an intelligent system for emergency management in the field of hydrology. This tool has been developed following an innovative approach directed to end-users non familiarized in computer oriented terminology. According to this approach, the tool is conceived as a document processor specialized in a particular domain (hydrology) in such a way that the whole knowledge model is viewed by the user as an electronic document. The paper first describes the characteristics of the knowledge model of the intelligent system and summarizes the problems that we found during the development and maintenance of such type of model. Then, the paper describes the KATS tool, a software application that we have designed to help in this task to be used by users who are not experts in computer programming. Finally, the paper shows a comparison between KATS and other approaches for knowledge acquisition.

5-HT2A and 5-HT2C receptors as hypothalamic targets of developmental programming in male rats

Funding The research reported in this publication was supported by the Biotechnology and Biological Sciences Research Council (E007821/1 to M.S.M-G, R.L.C and E00797X/1; BB/K001418 /1 to L.K.H), the British Heart Foundation (FS/09/029/27902 to S.E.O.), the UK Medical Research Council Metabolic Diseases Unit (MC_UU_12012/4 to S.E.O and MC_UU_12012/1 to G.S.H.Y), the Wellcome Trust (WT081713 and WT098012 to L.K.H), the European Union (FP7-HEALTH-266408 Full4Health to G.S.H.Y) and the Helmholtz Alliance ICEMED to G.S.H.Y.

Syntax processing by auditory cortical neurons in the FM–FM area of the mustached bat Pteronotus parnellii

Syntax denotes a rule system that allows one to predict the sequencing of communication signals. Despite its significance for both human speech processing and animal acoustic communication, the representation of syntactic structure in the mammalian brain has not been studied electrophysiologically at the single-unit level. In the search for a neuronal correlate for syntax, we used playback of natural and temporally destructured complex species-specific communication calls—so-called composites—while recording extracellularly from neurons in a physiologically well defined area (the FM–FM area) of the mustached bat’s auditory cortex. Even though this area is known to be involved in the processing of target distance information for echolocation, we found that units in the FM–FM area were highly responsive to composites. The finding that neuronal responses were strongly affected by manipulation in the time domain of the natural composite structure lends support to the hypothesis that syntax processing in mammals occurs at least at the level of the nonprimary auditory cortex.

Use of chimeric proteins to investigate the role of transporter associated with antigen processing (TAP) structural domains in peptide binding and translocation

The transporter associated with antigen processing (TAP) comprises two subunits, TAP1 and TAP2, each containing a hydrophobic membrane-spanning region (MSR) and a nucleotide binding domain (NBD). The TAP1/TAP2 complex is required for peptide translocation across the endoplasmic reticulum membrane. To understand the role of each structural unit of the TAP1/TAP2 complex, we generated two chimeras containing TAP1 MSR and TAP2 NBD (T1MT2C) or TAP2 MSR and TAP1 NBD (T2MT1C). We show that TAP1/T2MT1C, TAP2/T1MT2C, and T1MT2C/T2MT1C complexes bind peptide with an affinity comparable to wild-type complexes. By contrast, TAP1/T1MT2C and TAP2/T2MT1C complexes, although observed, are impaired for peptide binding. Thus, the MSRs of both TAP1 and TAP2 are required for binding peptide. However, neither NBD contains unique determinants required for peptide binding. The NBD-switched complexes, T1MT2C/T2MT1C, TAP1/T2MT1C, and TAP2/T1MT2C, all translocate peptides, but with progressively reduced efficiencies relative to the TAP1/TAP2 complex. These results indicate that both nucleotide binding sites are catalytically active and support an alternating catalytic sites model for the TAP transport cycle, similar to that proposed for P-glycoprotein. The enhanced translocation efficiency of TAP1/T2MT1C relative to TAP2/T1MT2C complexes correlates with enhanced binding of the TAP1 NBD-containing constructs to ATP-agarose beads. Preferential ATP interaction with TAP1, if occurring in vivo, might polarize the transport cycle such that ATP binding to TAP1 initiates the cycle. However, our observations that TAP complexes containing two identical TAP NBDs can mediate translocation indicate that distinct properties of the nucleotide binding site per se are not essential for the TAP catalytic cycle.

The Chloroplast atpA Gene Cluster in Chlamydomonas reinhardtii1 : Functional Analysis of a Polycistronic Transcription Unit

Most chloroplast genes in vascular plants are organized into polycistronic transcription units, which generate a complex pattern of mono-, di-, and polycistronic transcripts. In contrast, most Chlamydomonas reinhardtii chloroplast transcripts characterized to date have been monocistronic. This paper describes the atpA gene cluster in the C. reinhardtii chloroplast genome, which includes the atpA, psbI, cemA, and atpH genes, encoding the α-subunit of the coupling-factor-1 (CF1) ATP synthase, a small photosystem II polypeptide, a chloroplast envelope membrane protein, and subunit III of the CF0 ATP synthase, respectively. We show that promoters precede the atpA, psbI, and atpH genes, but not the cemA gene, and that cemA mRNA is present only as part of di-, tri-, or tetracistronic transcripts. Deletions introduced into the gene cluster reveal, first, that CF1-α can be translated from di- or polycistronic transcripts, and, second, that substantial reductions in mRNA quantity have minimal effects on protein synthesis rates. We suggest that posttranscriptional mRNA processing is common in C. reinhardtii chloroplasts, permitting the expression of multiple genes from a single promoter.

COOH-terminal processing of nascent polypeptides by the glycosylphosphatidylinositol transamidase in the presence of hydrazine is governed by the same parameters as glycosylphosphatidylinositol addition.

Proteins anchored to the cell membrane via a glycosylphosphatidylinositol (GPI) moiety are found in all eukaryotes. After NH2-terminal peptide cleavage of the nascent protein by the signal peptidase, a second COOH-terminal signal peptide is cleaved with the concomitant addition of the GPI unit. The proposed mechanism of the GPI transfer is a transamidation reaction that involves the formation of an activated carbonyl intermediate (enzyme-substrate complex) with the ethanolamine moiety of the preassembled GPI unit serving as a nucleophile. Other nucleophilic acceptors like hydrazine (HDZ) and hydroxylamine have been shown to be possible alternate substrates for GPI. Since GPI has yet to be purified, the use of readily available nucleophilic substitutes such as HDZ and hydroxylamine is a viable alternative to study COOH-terminal processing by the putative transamidase. As a first step in developing a soluble system to study this process, we have examined the amino acid requirements at the COOH terminus for the transamidation reaction using HDZ as the nucleophilic acceptor instead of GPI. The hydrazide-forming reaction shows identical amino acid requirement profiles to that of GPI anchor addition. Additionally, we have studied other parameters relating to the kinetics of the transamidation reaction in the context of rough microsomal membranes. The findings with HDZ provide further evidence for the transamidase nature of the enzyme and also provide a starting point for development of a soluble assay.

Fénix: a flexible information exchange data model for natural language processing

In this paper we describe Fénix, a data model for exchanging information between Natural Language Processing applications. The format proposed is intended to be flexible enough to cover both current and future data structures employed in the field of Computational Linguistics. The Fénix architecture is divided into four separate layers: conceptual, logical, persistence and physical. This division provides a simple interface to abstract the users from low-level implementation details, such as programming languages and data storage employed, allowing them to focus in the concepts and processes to be modelled. The Fénix architecture is accompanied by a set of programming libraries to facilitate the access and manipulation of the structures created in this framework. We will also show how this architecture has been already successfully applied in different research projects.

Refinery Nonconventional Feedstocks: Influence of the Coprocessing of Vacuum Gas Oil and Low Density Polyethylene in Fluid Catalytic Cracking Unit on Full Range Gasoline Composition

Gasoline coming from refinery fluid catalytic cracking (FCC) unit is a major contributor to the total commercial grade gasoline pool. The contents of the FCC gasoline are primarily paraffins, naphthenes, olefins, aromatics, and undesirables such as sulfur and sulfur containing compounds in low quantities. The proportions of these components in the FCC gasoline invariable determine its quality as well as the performance of the associated downstream units. The increasing demand for cleaner and lighter fuels significantly influences the need not only for novel processing technologies but also for alternative refinery and petrochemical feedstocks. Current and future clean gasoline requirements include increased isoparaffins contents, reduced olefin contents, reduced aromatics, reduced benzene, and reduced sulfur contents. The present study is aimed at investigating the effect of processing an unconventional refinery feedstock, composed of blend of vacuum gas oil (VGO) and low density polyethylene (LDPE) on FCC full range gasoline yields and compositional spectrum including its paraffins, isoparaffins, olefins, napthenes, and aromatics contents distribution within a range of operating variables of temperature (500–700 °C) and catalyst-feed oil ratio (CFR 5–10) using spent equilibrium FCC Y-zeolite based catalyst in a FCC pilot plant operated at the University of Alicante’s Research Institute of Chemical Process Engineering (RICPE). The coprocessing of the oil-polymer blend led to the production of gasoline with very similar yields and compositions as those obtained from the base oil, albeit, in some cases, the contribution of the feed polymer content as well as the processing variables on the gasoline compositional spectrum were appreciated. Carbon content analysis showed a higher fraction of the C9–C12 compounds at all catalyst rates employed and for both feedstocks. The gasoline’s paraffinicity, olefinicity, and degrees of branching of the paraffins and olefins were also affected in various degrees by the scale of operating severity. In the majority of the cases, the gasoline aromatics tended toward the decrease as the reactor temperature was increased. While the paraffins and iso-paraffins gasoline contents were relatively stable at around 5 % wt, the olefin contents on the other hand generally increased with increase in the FCC reactor temperature.

Time-Precision Flexible Arithmetic Unit

Paper submitted to the XVIII Conference on Design of Circuits and Integrated Systems (DCIS), Ciudad Real, España, 2003.