Currently, six medications are approved by the US FDA for the treatment of relapsing forms of multiple sclerosis (MS). In contrast, no pharmacological agent has proved to be effective in patients with secondary-progressive MS without relapses, or in patients with primary-progressive MS. One of the principal issues concerning an optimal pharmacotherapy for relapsing forms of MS is the optimal time of treatment initiation. There is now an almost universal consensus among MS experts that many patients will benefit from early therapy. However, several formidable challenges exist in identifying individuals who will benefit versus those who will do well without intervention. How do we define early MS and what clinical and paraclinical markers may be useful in defining the timing and nature of therapy? Do patients with a benign form of MS require therapy or are they exposed unnecessarily to adverse effects of our currently available medications? How do we identify disease progression and treatment failures? This review discusses these issues and outlines the evidence for application of 'early' treatment in patients with relapsing forms of MS.

Universities are encouraging the implementation of innovative methodologies and teaching strategies to develop an interactive and appealing educational environment where students are the focus of the learning process. In such a personalised learning environment, an increase of the students’ engagement and the improvement of the outcomes arise. MathE has been developed to help achieve this goal. Based on collaborative procedures, internet resources – both pre-existing and freely available as well as resources specifically conceived by the project team – and communities of practices, MathE intends to be a tool to nurture and stimulate the learning of Mathematics in higher education. This study introduces and describes the MathE platform, which is divided into three sections: Student’s Assessment, Library and Community of Practice. An in-depth description of the Student’s Assessment section is presented and an analysis of the results obtained from students, when using this feature of the platform, is also provided. After this, and based on the answers to an online survey, the impact of the MathE platform among students and teachers of eight countries is shown. Although the number of collected results is still scarce, it allows the recognition of a trend regarding the use of the material of the Student’s Assessment section for autonomous study. The results indicate the platform is well organized, with a satisfactory amount and diversity of questions and good interconnection between the various parts. Nevertheless, both teachers and students indicate that more questions should be introduced. The overall opinion about the MathE platform is very favourable.

The paper begins with a new characterization of (k, τ )-regular sets. Then, using this result as well as the theory of star complements, we derive a simplex-like algorithm for determining whether or not a graph contains a (0, τ )-regular set. When τ = 1, this algorithm can be applied to solve the efficient dominating set problem which is known to be NPcomplete. If −1 is not an eigenvalue of the adjacency matrix of the graph, this particular algorithm runs in polynomial time. However, although it doesn't work in polynomial time in general, we report on its successful application to a vast set of randomly generated graphs.