fr:projet_historical_facts_analyzer

Différences

Ci-dessous, les différences entre deux révisions de la page.

Lien vers cette vue comparative

Les deux révisions précédentes Révision précédente
Prochaine révision		 Révision précédente
fr:projet_historical_facts_analyzer [2017/01/27 14:39] – fragglefr:projet_historical_facts_analyzer [2021/12/27 18:23] (Version actuelle) – modification externe 127.0.0.1
Ligne 5: Ligne 5:
  
 Let's define the finite set of historical facts $ \mathcal{F} = \{f_{1},\dots,f_{n}\} $.\\  Let's define the finite set of historical facts $ \mathcal{F} = \{f_{1},\dots,f_{n}\} $.\\ 
-$ \forall i \in \{1,\dots,n\}; \\ +$$  
 +\forall i \in \{1,\dots,n\}; \
 \begin{array}{lrcl}  \begin{array}{lrcl} 
     h: & \mathcal{F} & \longrightarrow & \{0,1\} \\     h: & \mathcal{F} & \longrightarrow & \{0,1\} \\
Ligne 14: Ligne 14:
                                                              \end{array}                                                               \end{array} 
                                                         \right .                                                         \right .
-\end{array} $ +\end{array} $$ 
  
 The set $ \mathcal{F} $ is meant to be a complete set of all facts that might happen or not. The $ h $ function is only here to cope with the complexity associated to build a reduction of the list of facts to simple logical fact that only exist or not in the history line we want to model.   The set $ \mathcal{F} $ is meant to be a complete set of all facts that might happen or not. The $ h $ function is only here to cope with the complexity associated to build a reduction of the list of facts to simple logical fact that only exist or not in the history line we want to model.  
Ligne 20: Ligne 20:
 In order to build facts dependencies, we define the function $ p $ between two edges of the set $ \mathcal{F} $ : In order to build facts dependencies, we define the function $ p $ between two edges of the set $ \mathcal{F} $ :
  
-$ \begin{array}{lrcl} +$$ \begin{array}{lrcl} 
     p: & \mathcal{F} \times \mathcal{F} & \longrightarrow & [0,1] \\     p: & \mathcal{F} \times \mathcal{F} & \longrightarrow & [0,1] \\
        & (f_{i},f_{j}) & \stackrel{p}{\longmapsto} & p((f_{i},f_{j}))        & (f_{i},f_{j}) & \stackrel{p}{\longmapsto} & p((f_{i},f_{j}))
-\end{array} $ +\end{array} $$ 
  
 that capture the dependency probability that $ f_{j} $ has in regard to $ f_{i} $.     that capture the dependency probability that $ f_{j} $ has in regard to $ f_{i} $.    
  • fr/projet_historical_facts_analyzer.1485524360.txt.gz
  • Dernière modification : il y a 2 ans
  • (modification externe)