Protocol and Results Clause Samples

Protocol and Results. As in the challenge tasks, we evaluate performance in terms of unweighted average recall (UAR). In addition, we use the original challenge feature sets for the tasks of emotion and likability recognition in our experiments. Thus, for emotion recognition, we use 384 features resulting from a systematic combination of 16 low-level-descriptors (LLDs) and corresponding first order delta coefficients with 12 functionals (▇▇▇▇▇▇▇▇ et al., 2009); for likability recogni- tion, we utilize 6 125 features by brute-forcing based on 64 LLDs and 61 functionals (▇▇▇▇▇▇▇▇ et al., 2012a) – all features are extracted with the open-source toolkit openS- MILE (Eyben et al., 2010). In the same vein, we keep the classifiers, their implementations, and parameters as in Challenges: for emotion recognition, Support Vector Ma- chines (SVMs) trained by Sequential Minimal Optimiza- tion (SMO) with polynomial kernel (degree 1) and a com- plexity constant of 0.05; for likability recognition, Random Forests (RF) with a number of trees N = 1 000 and a fea- ture subspace size of P = .02. The Weka toolkit (Hall et al., 2009) is used in both cases. Note, that the instance se- lection algorithm is only applied on the training set. The test set is not modified and kept the same as in the original Challenge setup in order to allow for a direct comparison.
Protocol and Results. ‌ We study the following population protocol. Initially, there are n agents, each of which has one out of k colours; and each colour i ∈ [k] has an associated weight 1 . The system evolves as follows: at every time-step an agent u is chosen out of n agents (scheduled) u.a.r.2. The scheduled agent u then samples another agent v from its n − 1 neighbours u.a.r., and observes the colour of v as well as its weight, and then processes such information, leading to a possible change of colour and the corresponding weight. We denote by cu(t) the colour of agent u after the t-th time- step, and cu(0) its initial colour. Additionally, we denote by Ci(t) the number of agents with colour i at time-step t , i.e., Ci(t) = |v ∈ [n] : cv(t) = i| .