Jurnal Edukasi
Not a member yet
4879 research outputs found
Sort by
S’engager dans l’Open Innovation: Fondations, démarches et grandes pratiques
No full textInternational audienceDans ce rapport qui s’appuie sur une revue de travaux récents portant sur l’Open Innovation (articles scientifiques, livres publiés et articles de conférences), nous cherchons à expliquer les grands principes de l’Open Innovation tels qu’ils sont analysés et décrits par le monde de la recherche académique. Aussi, nous commençons par présenter les trois grands piliers de cette littérature et ce qu’ils apportent de nouveau : le livre fondateur d’Henri Chesbrough et sa représentation de ce qu’est l’Open Innovation, la notion de capacité d’absorption d’une entreprise et la notion de lead-user. Puis, nous présentons les résultats de l’étude des entreprises qui se sont engagées dans des démarches d’ouverture de leur innovation et la majeure difficulté rencontrée par celles-ci : la barrière culturelle à franchir. Enfin, nous terminons par balayer les grandes familles de pratiques rencontrées dans l’Open Innovation en action : la recherche de savoirs externes, leur intégration en interne puis leur commercialisation
OpenMOLE: a Workflow Engine for Distributed Medical Image Analysis
No full textInternational audienceThis works demonstrates how the OpenMOLE platform can provide a straightforward way to distribute heavy workloads generated by medical imaging analysis. OpenMOLE allows its users to benefit from a large set of distributed computing infrastructures such as clusters or com-puting grids, no matter the kind of application they are running. Here we extend the OpenMOLE tools to two new cluster job schedulers: SLURM and Condor. We also contribute to the Yapa pack-aging tool to support the widely spread virtual environment package from the Python programming language. Our test case shows how our developments allow a medical imaging application to be distributed using the OpenMOLE toolkit
Mechanisms for U2AF to define 3' splice sites and regulate alternative splicing in the human genome
No full textInternational audienceThe U2AF heterodimer has been well studied for its role in defining functional 3′ splice sites in pre-mRNA splicing, but many fundamental questions still remain unaddressed regarding the function of U2AF in mammalian genomes. Through genome-wide analysis of U2AF-RNA interactions, we report that U2AF has the capacity to directly define ~88% of functional 3′ splice sites in the human genome, but numerous U2AF binding events also occur in intronic locations. Mechanistic dissection reveals that upstream intronic binding events interfere with the immediate downstream 3′ splice site associated either with the alternative exon, to cause exon skipping, or with the competing constitutive exon, to induce exon inclusion. We further demonstrate partial functional impairment with leukemia-associated mutations in U2AF35, but not U2AF65, in regulated splicing. These findings reveal the genomic function and regulatory mechanism of U2AF in both normal and disease states
Modèles basés sur les données pour le contrôle d'écoulement
No full textThis thesis presents two experimental data-based model design techniques:the system identification and the data-assimilation. The first allows theconstruction of a model, based on the system’s input-output signals only. Severalflow-control examples, using system identification, are described: flow inside achannel, and behind a cylinder. Data-assimilation is another data-based techniquewhich makes use of a physical model. The assimilated model gives access to physics basedinterpolation and extrapolation of a scattered data-set. Three examples ofmean-velocity measurement assimilation are presented: a turbulent boundary layer,the flow around a cylinder, and the flow over an idealized airfoil. The impact of measurementuncertainty is demonstrated. An extension is developed for both methodsto cope with corrupted data.Cette thèse est basé sur les méthodes de construction de modèles utilisantdes données expérimentales. Deux groupes de méthodes sont étudiées, l’identificationde systèmes et l’assimilation de données. La première permet de mettre en placeune représentation pour un système donné en se basant sur l’histoire de ses entréessorties. Cette représentation est calculée puis utilisée pour contrôler efficacementplusieurs exemples d’écoulements. La seconde, nécessite un modèle physique et meten oeuvre des mesures qui relève du vecteur d’état. Le modèle qui assimile lesdonnées offre un moyen d’extrapoler et d’interpoler ces dernières. Trois exemplesd’assimilation de vitesses moyennes sont présentées, une couche limite turbulente,l’écoulement autour d’un cylindre et l’écoulement autour d’un profil d’aile idéalisé.Enfin plusieurs pistes pour la prise en compte d’incertitudes de mesures sontdéveloppés, pour l’assimilation de données et l’identification de systèmes
Call-by-value, call-by-name and the vectorial behaviour of the algebraic λ-calculus
No full textInternational audienceWe examine the relationship between the algebraic lambda-calculus, a fragment of the differential lambda-calculus and the linear-algebraic lambda-calculus, a candidate lambda-calculus for quantum computation. Both calculi are algebraic: each one is equipped with an additive and a scalar-multiplicative structure, and their set of terms is closed under linear combinations. However, the two languages were built using different approaches: the former is a call-by-name language whereas the latter is call-by-value; the former considers algebraic equalities whereas the latter approaches them through rewrite rules. In this paper, we analyse how these different approaches relate to one another. To this end, we propose four canonical languages based on each of the possible choices: call-by-name versus call-by-value, algebraic equality versus algebraic rewriting. We show that the various languages simulate one another. Due to subtle interaction between beta-reduction and algebraic rewriting, to make the languages consistent some additional hypotheses such as confluence or normalisation might be required. We carefully devise the required properties for each proof, making them general enough to be valid for any sub-language satisfying the corresponding properties
The tropical shadow-vertex algorithm solves mean payoff games in polynomial time on average
No full textInternational audienceWe introduce an algorithm which solves mean payoff games in polynomial time on average, assuming the distribution of the games satisfies a flip invariance property on the set of actions associated with every state. The algorithm is a tropical analogue of the shadow-vertex simplex algorithm, which solves mean payoff games via linear feasibility problems over the tropical semiring (ℝ∪{−∞},max,+). The key ingredient in our approach is that the shadow-vertex pivoting rule can be transferred to tropical polyhedra, and that its computation reduces to optimal assignment problems through Plücker relations
Generalization of Gabidulin Codes over Fields of Rational Functions
No full textInternational audienceWe transpose the theory of rank metric and Gabidulin codes to the case of fields which are not finite fields. The Frobenius automorphism is replaced by any element of the Galois group of a cyclic algebraic extension of a base field. We use our framework to define Gabidulin codes over the field of rational functions using algebraic function fields with a cyclic Galois group. This gives a linear subspace of matrices whose coefficients are rational function, such that the rank of each of this matrix is lower bounded, where the rank is comprised in term of linear combination with rational functions. We provide two examples based on Kummer and Artin-Schreier extensions.The matrices that we obtain may be interpreted as generating matrices of convolutional codes
A Direct Version of Veldman's Proof of Open Induction on Cantor Space via Delimited Control Operators
No full textInternational audienceFirst, we reconstruct Wim Veldman's result that Open Induction on Cantor space can be derived from Double-negation Shift and Markov's Principle. In doing this, we notice that one has to use a countable choice axiom in the proof and that Markov's Principle is replaceable by slightly strengthening the Double-negation Shift schema. We show that this strengthened version of Double-negation Shift can nonetheless be derived in a constructive intermediate logic based on delimited control operators, extended with axioms for higher-type Heyting Arithmetic. We formalize the argument and thus obtain a proof term that directly derives Open Induction on Cantor space by the shift and reset delimited control operators of Danvy and Filinski
The changing Arctic and Subarctic environment: proxy- and model-based reconstructions of Holocene climate variability in the northern North Atlantic : Preface
No full textInternational audienceThis special issue originates from the EU FP7-Marie Curie initiative “CASE” (The Changing Arctic and Subarctic Environment),an Initial Training Network (ITN) on marine biotic indicators of recent climate changes in the high latitudes of the North Atlantic (http://caseitn.epoc.u-bordeaux1.fr/)