Différences

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

--- fr:projet_historical_facts_analyzer [2015/06/05 08:48] – fraggle
+++ fr: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}\} $.\\
-$ \forall i \in \{1,\dots,n\}, \\
+$$
+\forall i \in \{1,\dots,n\}; \
 \begin{array}{lrcl}
-    f: & \mathcal{F} & \longrightarrow & \{0,1\} \\
+    h: & \mathcal{F} & \longrightarrow & \{0,1\} \\
-       & f_{i} & \stackrel{f}{\longmapsto} & f(f_{i}) = \left\{
+       & f_{i} & \stackrel{h}{\longmapsto} & h(f_{i}) = \left\{
-                                                             \begin{array}{rl} 0 & \quad si\,f_{i}\,est\,arrivé \\
+                                                             \begin{array}{rl} 0 & \quad if\,f_{i}\,has\,happened \\
-& \quad si\,f_{i}\,est\,n'est\,pas\,arrivé
+& \quad if\,f_{i}\,hasn't\,happened
                                                              \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.
+In order to build facts dependencies, we define the function $ p $ between two edges of the set $ \mathcal{F} $ :
-The set $ \mathcal{F} $ is mean to be a complete set of all facts that might happen or not. The $ f $ 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.
+$$ \begin{array}{lrcl}
+    p: & \mathcal{F} \times \mathcal{F} & \longrightarrow & [0,1] \\
+       & (f_{i},f_{j}) & \stackrel{p}{\longmapsto} & p((f_{i},f_{j}))
+\end{array} $$
-In order to build facts dependencies, we define the function $ p $ between two edges of the set $ \ mathcal{F} $ :
+that capture the dependency probability that $ f_{j} $ has in regard to $ f_{i} $.