From software extensions to product lines of dataflow programs

Abstract Dataflow programs are widely used. Each program is a directed graph where nodes are computations and edges indicate the flow of data. In prior work, we reverse-engineered legacy dataflow programs by deriving their optimized implementations from a simple specification graph using graph transformations called refinements and optimizations. In MDE-speak, our derivations were PIM-to-PSM mappings. In this paper, we show how extensions complement refinements, optimizations, and PIM-to-PSM derivations to make the process of reverse engineering complex legacy dataflow programs tractable. We explain how optional functionality in transformations can be encoded, thereby enabling us to encode product lines of transformations as well as product lines of dataflow programs. We describe the implementation of extensions in the ReFlO tool and present two non-trivial case studies as evidence of our work’s generality

Eliciting and fostering learners' metacognitive knowledge about language learning in self-directed learning programs: a review of data collection methods and procedures

Són molts els estudis que avui en dia incideixen en la necessitat d’oferir un suport metodològic i psicològic als aprenents que treballen de manera autònoma. L’objectiu d’aquest suport és ajudar-los a desenvolupar les destreses que necessiten per dirigir el seu aprenentatge així com una actitud positiva i una major conscienciació envers aquest aprenentatge. En definitiva, aquests dos tipus de preparació es consideren essencials per ajudar els aprenents a esdevenir més autònoms i més eficients en el seu propi aprenentatge. Malgrat això, si bé és freqüent trobar estudis que exemplifiquen aplicacions del suport metodològic dins els seus programes, principalment en la formació d’estratègies o ajudant els aprenents a desenvolupar un pla de treball, aquest no és el cas quan es tracta de la seva preparació psicològica. Amb rares excepcions, trobem estudis que documentin com s’incideix en les actituds i en les creences dels aprenents, també coneguts com a coneixement metacognitiu (CM), en programes que fomenten l’autonomia en l’aprenentatge. Els objectius d’aquest treball son dos: a) oferir una revisió d’estudis que han utilitzat diferents mitjans per incidir en el CM dels aprenents i b) descriure les febleses i avantatges dels procediments i instruments que utilitzen, tal com han estat valorats en estudis de recerca, ja que ens permetrà establir criteris objectius sobre com i quan utilitzar-los en programes que fomentin l’aprenentatge autodirigit.

On the set of subrings wich are directed unions of Artinian subrings

The paper contributes to the investigation of zero-dimensional rings which can be written as a directed union of Artinian subrings. We give conditions on DU(R) in order to be nonempty.

Testing Cayley graph densities

We present a computer-assisted analysis of combinatorial properties of the Cayley graphs of certain finitely generated groups: Given a group with a finite set of generators, we study the density of the corresponding Cayley graph, that is, the least upper bound for the average vertex degree (= number of adjacent edges) of any finite subgraph. It is known that an m-generated group is amenable if and only if the density of the corresponding Cayley graph equals to 2m. We test amenable and non-amenable groups, and also groups for which amenability is unknown. In the latter class we focus on Richard Thompson’s group F.

North-South trade and directed technical change

In a world where poor countries provide weak protection for intellectual property rights (IPRs), market integration shifts technical change in favor of rich nations. Through this channel, free trade may amplify international income differences. At the same time, integration with countries where IPRs are weakly protected can slow down the world growth rate. An important implication of these results is that protection of intellectual property is most beneficial in open countries. This prediction, which is novel in the literature, is consistent with evidence from a panel of 53 countries observed in the years 1965-1990. The paper also provides empirical support for the mechanism linking North-South trade to the direction of technical change: an increase in import penetration from low-wage, low-IPRs, countries is followed by a sharp fall in R&D investment in a panel of US manufacturing sectors.

Human antibody responses to Schistosoma mansoni: does antigen directed, isotype restriction result in the production of blocking antibodies?

After treatment young Kenyan schoolchildren are highly susceptible to reinfection with Schistosoma mansoni. Older children and adults are resistant to reinfection. There is no evidence that this age related resistance is due to a slow development of protective immunological mechanisms, rather, it appears that young children are susceptible because of the presence of blocking antibodies which decline with age, thus allowing the expression of protective responses. Correlations between antibody responses to different stages of the parasite life-cycle suggest that, in young children, antigen directed, isotype restriction of the response against cross-reactive polysaccharide egg antigens results in an ineffectual, or even blocking antibody response to the schistosomulum.

Directed integration of new insulated lentiviral vectors to heterochromatin towards safer gene transfer to stem cells

The need for better gene transfer systems towards improved risk=benefit balance for patients remains a major challenge in the clinical translation of gene therapy (GT). We have investigated the improvement of integrating vectors safety in combining (i) new short synthetic genetic insulator elements (GIE) and (ii) directing genetic integration to heterochromatin. We have designed SIN-insulated retrovectors with two candidate GIEs and could identify a specific combination of insulator 2 repeats which translates into best functional activity, high titers and boundary effect in both gammaretro (p20) and lentivectors (DCaro4) (see Duros et al, abstract ibid). Since GIEs are believed to shield the transgenic cassette from inhibitory effects and silencing, DCaro4 has been further tested with chimeric HIV-1 derived integrases which comprise C-ter chromodomains targeting heterochromatin through either histone H3 (ML6chimera) or methylatedCpGislands (ML10). With DCaro4 only and both chimeras, a homogeneous expression is evidenced in over 20% of the cells which is sustained over time. With control lentivectors, less than 2% of cells express GFP as compared to background using a control double-mutant in both catalytic and ledgf binding-sites; in addition, a two-times increase of expression can be induced with histone deacetylase inhibitors. Our approach could significantly reduce integration into open chromatin sensitive sites in stem cells at the time of transduction, a feature which might significantly decrease subsequent genotoxicity, according to X-SCIDs patients data.Work performed with the support of EC-DG research within the FP6-Network of Excellence, CLINIGENE: LSHB-CT-2006-018933

Directed Search over the Life Cycle

We develop a life-cycle model of the labor market in which different worker-firm matches have different quality and the assignment of the right workers to the right firms is time consuming because of search and learning frictions. The rate at which workers move between unemployment, employment and across different firms is endogenous because search is directed and, hence, workers can choose whether to seek low-wage jobs that are easy to find or high-wage jobs that are hard to find. We calibrate our theory using data on labor market transitions aggregated across workers of different ages. We validate our theory by showing that it predicts quite well the pattern of labor market transitions for workers of different ages. Finally, we use our theory to decompose the age profiles of transition rates, wages and productivity into the effects of age variation in work-life expectancy, human capital and match quality.

Lack of directed V alpha 14-J alpha 281 rearrangements in NK1+ T cells.

NK1.1+ T cells are an unusual subset of TCR alpha beta cells distinguished by their highly restricted V beta repertoire and predominant usage of an invariant V alpha 14-J alpha 281 chain. To assess whether a directed rearrangement mechanism could be responsible for this invariant alpha chain, we have analyzed V alpha 14 rearrangements by polymerase chain reaction and Southern blot in a panel of cloned T-T hybrids derived from thymic NK1.1+ T cells. As expected a high proportion (17/20) of the hybrids had rearranged V alpha 14 to J alpha 281. However, V alpha 14-J alpha 281 rearrangements always occurred on only one chromosome and were accompanied by other V alpha-J alpha rearrangements (not involving V alpha 14) on the homologous chromosome. These data argue that rigorous ligand selection rather than directed rearrangement is responsible for the high frequency of V alpha 14-J alpha 281 rearrangements in NK1.1+ T cells.

Generation of a recombinant mouse-human chimaeric monoclonal antibody directed against human carcinoembryonic antigen.

A procedure was devised for the identification and specific cloning of functionally rearranged variable region immunoglobulin (Ig) gene segments from genomic DNA of a murine hybridoma cell line which produces a high-affinity monoclonal antibody (MAb) directed against human carcinoembryonic antigen (CEA). The cloned, functionally-rearranged murine Ig H-chain and L-chain variable region gene segments were incorporated into plasmid vectors capable of directing the expression of a chimaeric mouse-human antibody molecule with human (gamma 4, kappa) constant region sequences. Expression plasmids were transfected into a mouse myeloma cell line by electroporation and transfectomas secreting functional chimaeric antibody selected. Chimaeric antibody generated by transfectomas was analysed and shown to compete effectively with its murine counterpart for binding to the CEA epitope, and to have an equivalent antigen-binding affinity. This anti-CEA recombinant antibody should find application in in vivo diagnosis by immunoscintigraphy of human colonic carcinoma, and possibly also in therapy of the disease, overcoming some of the difficulties associated with the repeated use of non-human immunoglobulins in human patients.

Theoretical aspects of graph models for MANETs

We survey the main theoretical aspects of models for Mobile Ad Hoc Networks (MANETs). We present theoretical characterizations of mobile network structural properties, different dynamic graph models of MANETs, and finally we give detailed summaries of a few selected articles. In particular, we focus on articles dealing with connectivity of mobile networks, and on articles which show that mobility can be used to propagate information between nodes of the network while at the same time maintaining small transmission distances, and thus saving energy.

Dynamical modeling and analysis of large cellular regulatory networks.

The dynamical analysis of large biological regulatory networks requires the development of scalable methods for mathematical modeling. Following the approach initially introduced by Thomas, we formalize the interactions between the components of a network in terms of discrete variables, functions, and parameters. Model simulations result in directed graphs, called state transition graphs. We are particularly interested in reachability properties and asymptotic behaviors, which correspond to terminal strongly connected components (or "attractors") in the state transition graph. A well-known problem is the exponential increase of the size of state transition graphs with the number of network components, in particular when using the biologically realistic asynchronous updating assumption. To address this problem, we have developed several complementary methods enabling the analysis of the behavior of large and complex logical models: (i) the definition of transition priority classes to simplify the dynamics; (ii) a model reduction method preserving essential dynamical properties, (iii) a novel algorithm to compact state transition graphs and directly generate compressed representations, emphasizing relevant transient and asymptotic dynamical properties. The power of an approach combining these different methods is demonstrated by applying them to a recent multilevel logical model for the network controlling CD4+ T helper cell response to antigen presentation and to a dozen cytokines. This model accounts for the differentiation of canonical Th1 and Th2 lymphocytes, as well as of inflammatory Th17 and regulatory T cells, along with many hybrid subtypes. All these methods have been implemented into the software GINsim, which enables the definition, the analysis, and the simulation of logical regulatory graphs.

Fine specificity of a BALB/c T cell clone directed against beef apo cytochrome c.

A BALB/c cloned T cell line directed against beef apo cytochrome c was shown to exhibit the Lyt-1+2- cell surface phenotype. The fine specificity of antigen recognition exhibited by the T cell clone was assessed by using a variety of peptide preparations obtained from cytochrome c of different sources. The peptide segment recognized by this T cell clone, in conjunction with I-A region gene products, appeared similar to that bound by a monoclonal antibody specific for beef apo cytochrome c derived from the same strain of mice.

A linear optimization technique for graph pebbling

Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is NP 2 -complete. In this paper we develop a tool, called theWeight Function Lemma, for computing upper bounds and sometimes exact values for pebbling numbers with the assistance of linear optimization. With this tool we are able to calculate the pebbling numbers of much larger graphs than in previous algorithms, and much more quickly as well. We also obtain results for many families of graphs, in many cases by hand, with much simpler and remarkably shorter proofs than given in previously existing arguments (certificates typically of size at most the number of vertices times the maximum degree), especially for highly symmetric graphs. Here we apply theWeight Function Lemma to several specific graphs, including the Petersen, Lemke, 4th weak Bruhat, Lemke squared, and two random graphs, as well as to a number of infinite families of graphs, such as trees, cycles, graph powers of cycles, cubes, and some generalized Petersen and Coxeter graphs. This partly answers a question of Pachter, et al., by computing the pebbling exponent of cycles to within an asymptotically small range. It is conceivable that this method yields an approximation algorithm for graph pebbling.