Abstract
In this work, we investigate the superfluidic properties of light propagating in a four-level coherent atomic medium. The model is derived under the paraxial approximation in the form of a generalized nonlinear Schrodinger equation and features spatially controllable and quantum-enhanced optical properties, which can offer new possibilities in the field of optical analogue systems. In particular, we use this versatility to study the dynamics of an optical vortex beam confined in a nontrivial connected geometry, finding numerical evidence of another superfluidic signature analogue: the persistent current of light. (C) 2017 Optical Society of America

Abstract
BackgroundUltrasound is an effective tool for breast cancer diagnosis. However, its relatively low image quality makes small lesion analysis challenging. This promotes the development of tools to help clinicians in the diagnosis. MethodsWe propose a method for segmentation and three-dimensional (3D) reconstruction of lesions from ultrasound images acquired using the automated breast volume scanner (ABVS). Segmentation and reconstruction algorithms are applied to obtain the lesion's 3D geometry. A total of 140 artificial lesions with different sizes and shapes are reconstructed in gelatin-based phantoms and biological tissue. Dice similarity coefficient (DSC) is used to evaluate the reconstructed shapes. The algorithm is tested using a human breast phantom and clinical data from six patients. ResultsDSC values are 0.860.06 and 0.86 +/- 0.05 for gelatin-based phantoms and biological tissue, respectively. The results are validated by a specialized clinician. ConclusionsEvaluation metrics show that the algorithm accurately segments and reconstructs various lesions. Copyright (c) 2016 John Wiley & Sons, Ltd.

Abstract
Nowadays most learning problems demand adaptive solutions. Current challenges include temporal data streams, drift and non-stationary scenarios, often with text data, whether in social networks or in business systems. Various efforts have been pursued in machine learning settings to learn in such environments, specially because of their non-trivial nature, since changes occur between the distribution data used to define the model and the current environment. In this work we present the Drift Adaptive Retain Knowledge (DARK) framework to tackle adaptive learning in dynamic environments based on recent and retained knowledge. DARK handles an ensemble of multiple Support Vector Machine (SVM) models that are dynamically weighted and have distinct training window sizes. A comparative study with benchmark solutions in the field, namely the Learn + +.NSE algorithm, is also presented. Experimental results revealed that DARK outperforms Learn + +.NSE with two different base classifiers, an SVM and a Classification and Regression Tree (CART).

Abstract
In recent years Serious Games have evolved substantially, solving problems in diverse areas. In particular, in Cognitive Rehabilitation, Serious Games assume a relevant role. Traditional cognitive therapies are often considered repetitive and discouraging for patients and Serious Games can be used to create more dynamic rehabilitation processes, holding patients' attention throughout the process and motivating them during their road to recovery. This paper reviews Serious Games and user interfaces in rehabilitation area and details a Serious Games platform for Cognitive Rehabilitation that includes a set of features such as: natural and multimodal user interfaces and social features (competition, collaboration, and handicapping) which can contribute to augment the motivation of patients during the rehabilitation process. The web platform was tested with healthy subjects. Results of this preliminary evaluation show the motivation and the interest of the participants by playing the games.

Abstract

Abstract
The Network-on-Chip (NoC) architecture is an interconnect network with a good performance and scalability potential. Thus, it comes as no surprise that NoCs are among the most popular interconnect mediums in nowadays available many-core platforms. Over the years, the real-time community has been attempting to make NoCs amenable to the real-time analysis. One such approach advocates to employ virtual channels. Virtual channels are hardware resources that can be used as an infrastructure to facilitate flit-level preemptions between communication traffic flows. This gives the possibility to implement priority-preemptive arbitration policies in routers, which is a promising step towards deriving real-time guarantees for NoC traffic. So far, various aspects of priority-preemptive NoCs were studied, such as arbitration, priority assignment, routing, and workload mapping. Due to a potentially large solution space, the majority of available techniques are heuristic-centric, that is, either pure heuristics, or heuristic-based search strategies are used. Such approaches may lead to an inefficient use of hardware resources, and may cause a resource over-provisioning as well as unnecessarily high design-cost expenses. Motivated by this reality, we take a different approach, and propose an integer linear program to solve the problems of priority assignment and routing of NoC traffic. The proposed method finds optimal routes and priorities, but also allows to reduce the search space (and the computation time) by fixing either priorities or routes, and derive optimal values for remaining parameters. This framework is used to experimentally evaluate both the scalability of the proposed method, as well as the efficiency of existing priority assignment and routing techniques.