Abstract
We give a language-based security treatment of domain-specific languages and compilers for secure multi-party computation, a cryptographic paradigm that. enables collaborative computation over encrypted data. Computations are specified in a core imperative language, as if they were intended to be executed by a trusted-third party, and formally verified against. an information-flow policy modelling (an upper bound to) their leakage. This allows non-experts to assess the impact of performance driven authorized disclosure of intermediate values. Specifications are then compiled to multi-party protocols. We formalize protocol security using (distributed) probabilistic information-flow and prove security-preserving compilation: protocols only leak what. is allowed by the source policy. The proof exploits a natural but previously missing correspondence between simulation-based cryptographic proofs and (composable) probabilistic non-interference. Finally, we extend our framework to justify leakage cancelling, a domain-specific optimization that allows to first write an efficient specification that fails to meet the allowed leakage upper-bound, and then apply a probabilistic preprocessing that brings leakage to the acceptable range.

Abstract
Metaheuristics (MH) aptitude to move past local optimums makes them an attractive technique to approach complex computational problems, such as the Travelling Salesman Problem (TSP), but there is lack of information on the parameterization procedure and the appropriate parameters to improve MHs' performance. In this paper the parameterization procedure of Simulated Annealing (SA) and Discrete Artificial Bee Colony (DABC) is addressed, with a focus on the Neighborhood Structure (NS). Numerous NS have been proposed for specific problems, which seem to indicate that the NS is a special parameter, whose optimization is independent of other parameters. The performance of eight NS was examined with SA and DABC under two optimization constraints, regarding computational time variation, to determine if there is one appropriate NS for the TSP problem, independent of the rest of the parameters of the optimization procedure. The computational study carried out for comparing the evaluation of the NS, including a statistical analysis, demonstrated a nonproportional increase in the performance of DABC with some NS. For SA the improvement of the solutions appeared to be more uniform with an almost nonexistent variance in improvement.

Abstract
This paper provides an instrument for ascertaining researchers’ perspectives on the relative relevance of technological challenges facing immersive environments in view of their adoption in learning contexts, along three dimensions: access, content production, and deployment. It described its theoretical grounding and expert-review process, from a set of previously-identified challenges and expert feedback cycles. The paper details the motivation, setup, and methods employed, as well as the issues detected in the cycles and how they were addressed while developing the instrument. As a research instrument, it aims to be employed across diverse communities of research and practice, helping direct research efforts and hence contribute to wider use of immersive environments in learning, and possibly contribute towards the development of news and more adequate systems.

Abstract
In the retail industry, there are multiple products flowing from different distribution centers to brick-and-mortar stores with distinct characteristics. This industry has been suffering radical changes along the years and new market dynamics are making distribution more and more challenging. Consequently, there is a pressure to reduce shipment sizes and increase the delivery frequency. In such a context, defining the most efficient way to supply each store is a critical task. However, the supply chain planning decision that tackles this type of problem, delivery mode planning, is not well defined in the literature. This paper proposes a definition for delivery mode planning and analyzes multiple ways retailers can efficiently supply their brick-and-mortar stores from their distribution centers. The literature addressing this planning problem is reviewed and the main interdependencies with other supply chain planning decisions are discussed.

Abstract
The Internet of Things (IoT) is a new model that integrates physical objects and Internet and became one of the principal technological evolutions of computing. It is estimated that a trillion of physical objects will be connected to the Internet until 2022. The low accessibility and the lack of interoperability of many of these devices in a vast heterogenous landscape will make it very hard to design specific security measures and apply specific security mechanism. Moreover, IoT networks still exposed and vulnerable to attacks aimed to disrupt the network. Therefore, additional security tools specific to IoT are needed. Intrusion Detection System (IDS) could fulfill this purpose. In this paper, we present a literature review on the IDS in IoT topic, mainly focusing on the current state of research by examining the literature, identifying current trends and presenting open issues and future directions.

Abstract
Several Heart Rate Variability (HRV) based novel methodologies for describing heart rate dynamics have been proposed in the literature with the aim of risk assessment. One such methodology is ARFIMA-EGARCH modeling which allows the quantification of long range dependence and time-varying volatility with the aim of describing non-linear and complex characteristics of HRV. This study applies the ARFIMA-EGARCH modeling of HRV recordings from 30 patients of the Noltisalis database to investigate the discrimination power of a set of features comprising currently used linear HRV features (low and high frequency components) and new measures obtained from the modeling such as, long memory in the mean, and persistence and asymmetry in volatility. A subset of the multidimensional HRV features is selected in a two-step procedure using Principal Components Analysis (PCA). Additionally, supervised classification by quadratic discriminant analysis achieves 93.3% of discrimination accuracy between the groups using the new feature set created by PCA.