#!/bin/bash
# Parameters describing a LazyLav execution
# Please preserve the order

# Environment parameters
OSVERS=stretch
LOGBACK_VERSION=1.2.3
JPATH=lib/lazylav/ll.jar:lib/slf4j/logback-classic-${LOGBACK_VERSION}.jar:lib/slf4j/logback-core-${LOGBACK_VERSION}.jar:.

LLHASH=fa69a4569fb2ecd7d8f24759d1ce0cd71080811a

# Experiment parameters
DATE="2018-03-05"
LABEL=20180305-NOOR
NAME=${LABEL}
PERFORMER="Jérôme Euzenat (INRIA)"
NBAGENTS=4
NBITERATIONS=1000
NBRUNS=10
OPS="add addjoin"

OPT="-DnbAgents=4 -DnbIterations=1000 -DnbRuns=10 -DreportPrecRec -Drealistic"

# To be used when replaying
LOADOPT="-DloadDir=expeRun -DloadEnv -DloadAgents -DreplayGames"

DIRPREF=${NBAGENTS}-${NBITERATIONS}
TOCOPY="input"

# Variables

CONTROLED="revisionModality syntactic"
OBSERVED="srate size prec rec"
FIXED="nbIterations nbAgents nbRuns"

# Documentation parameters

VARIATIONOF=20140208-NOOR


RESULT="add = addjoin but faster (expansion/relaxation/generative/empty)"

HYPOTHESIS="The goal of this test is to check that the operators add and addjoin performs correctly. It enabled to verify that this was not the case. For that purpose, we use the new facility of Lazy lavender to redo exactly the same test. The hypotheses to be observed are They have the same size at convergence, Addjoin converges faster, Addjoin has a higher semantic precision all the time (idem for syntactic), Addjoin has a lower semantic recall all the time (syntactic are equal)"

SETTING="Same as the initial experiments 20140208-NOOR with repeatable series of events, precision and recall collected semantically and syntactically"

# Would be better automated
CLASSES="NOOEnvironment, AlignmentAdjustingAgent, AlignmentRevisionExperiment, ActionLogger, AverageLogger, Monitor."

# DEFAULT VALUES
EXPERIMENTER="${PERFORMER}"
ANALYST="${PERFORMER}"

STATUS=SUBSUMED
STATUSDESC="[20180826-NOOR]"