Abstract

Abstract

Abstract
This paper investigates the relationship between students' performance and the type of school attended during upper secondary education. The performance of three different types of schools (Liceo, Technical and Professional schools) in four Italian macroregions (North West, North East, Centre, South & Islands) is investigated. A benchmarking analysis of the variability in students' performance among regions (within macroregions) for cohorts of students attending Liceo is also conducted. The data was collected at the student level from the Italian Institute for the Evaluation of Education System (INVALSI), for the academic year 2017/18. Families with higher socio-economic status may self-select into Liceo, so a direct comparison with vocational schools could lead to biased conclusions regarding the impact of school type on student performance. To overcome this limitation, we used a Propensity Score Matching approach prior to the estimation of efficiency. A pseudo-Malmquist index, based on a metafrontier and satisfying the circular property, is developed. It enables comparing the location of the best-practice frontier for each type of school and the spread in the educational efficiency of the students attending each type of school. Thus, best performance of a given school type corresponds to the combined effect of these two aspects. This study is an interesting starting point to challenge the stereotypes that persist in Italy, especially concerning general and vocational studies and geographic differences in educational achievements.

Abstract
The storage policy has a tremendous impact on the efficiency of order-picking operations, which can account for up to 50% of operating costs. The coronavirus pandemic has reinforced the importance of managers making the right operational decisions, namely regarding the definition of the storage policy. It is therefore important to consider handling constraints. This article is inspired by a Portuguese retail company and it considers two handling constraints: weight and shape. We define the location of products by using a zero-one quadratic assignment model. In this model, in addition to the demand and similarity, we considered the weight and shape of the products. We used both weight and shape parameters to set products with similar shapes together, placing aside products with odd shapes. Our analysis shows that the inclusion of the shape and weight into the problem improved the current operations. We found that our method allowed for a reduction of up to 24% in the picking distance, a percentage higher than the one that only considers weight constraints. The inclusion of the shape parameter into the study enabled the company to increase the flow and efficiency of the order-picking operations. Thus, it can be an asset for other warehouses.

Abstract
This paper proposes a multi-objective mixed-integer linear programming to model a cold chain with complementary operations on a hierarchical hub network. Central hubs are linked to each other in the first level of the network and to the star network of the lower-level hubs. As for a case study, different hub levels provide various refreshing or freezing operations to keep the perishable goods fresh along the network. Disruption is formulated by the consideration of stochastic demand and multi-level freshness time windows. Regarding the solution, a genetic algorithm is also developed and compared for competing the large-sized networks.

Abstract
Encrypted databases systems and searchable encryption schemes still leak critical information (e.g.: access patterns) and require a choice between privacy and efficiency. We show that using ORAM schemes as a black-box is not a panacea and that optimizations are still possible by improving the data structures. We design an ORAM-based secure database that is built from the ground up: we replicate the typical data structure of a database system using different optimized ORAM constructions and derive a new solution for oblivious searches on databases. Our construction has a lower bandwidth overhead than state-of-the-art ORAM constructions by moving client-side computations to a proxy with an intermediate (rigorously defined) level of trust, instantiated as a server-side isolated execution environment. We formally prove the security of our construction and show that its access patterns depend only on public information. We also provide an implementation compatible with SQL databases (PostgresSQL). Our system is 1.2 times to 4 times faster than state-of-the-art ORAM-based solutions.