Abstract: The invention relates to a method for producing microalgae on a support (14) that is movably mounted essentially in an aqueous medium contained in a tank (12), said method comprising a succession of phases in which the microalgae developing on the support (14) are exposed to sunlight and phases in the shade, the light intensity received in the shade being less than 50% of the average light intensity received during the sunlight exposure phases. The total length of the shade phases is more than 50% longer than the total length of the sunlight exposure phases.
Type:
Grant
Filed:
July 15, 2014
Date of Patent:
October 23, 2018
Assignees:
Inria Institut National De Recherche En Informatique Et En Automatique, Centre National De La Recherche Scientifique (C.N.R.S), Ecole Centrale Paris, Universite Pierre Et Marie Curie (Paris 6)
Inventors:
Olivier Bernard, Filipa Lopes, Eric Pruvost, Antoine Sciandra
Abstract: A message passing scheme for MAP inference on Markov Random Fields based on a message computation using an intermediate input vector I, an output message vector M, an auxiliary seed vector S, all of equal length N, and a pairwise function r=d(x,y), where r, x, y are real numbers, includes: for each element j of vector S, do S(j)=j consider an index distance ?=2^floor(log 2(N)); repeat while ?>0 for each index of vector I, namely i, do in parallel: consider the set of all indices within distance ? from a given i, augmented by i; for every k belonging to this set, calculate its distance from i using the function: d(i,k)+I(S(k)); find the minimum distance and call n the index corresponding to this minimum distance do S(i)=S(n) ?=floor (?/2) for each j of vector M, do M(j)=I(S(j))+d(j,S(j)).
Abstract: A message passing scheme for MAP inference on Markov Random Fields based on a message computation using an intermediate input vector I, an output message vector M, an auxiliary seed vector S, all of equal length N, and a pairwise function r=d(x,y), where r,x,y are real numbers, includes: for each element j of vector S, do S(j)=j consider an index distance ?=2?floor(log2(N)); repeat while ?>0 for each index of vector I, namely i, do in parallel: consider the set of all indices within distance A from a given i, augmented by i; for every k belonging to this set, calculate its distance from i using the function: d(i,k)+I(S(k)); find the minimum distance and call n the index corresponding to this minimum distance do S(i)=S(n) ?=floor (?/2) for each j of vector M, do M(j)=I(S(j))+d(j,S(j)).