Abstract

Abstract
Purpose This paper aims to explore the changes imposed by the general data protection regulation (GDPR) on software engineering practices. The fundamental objective is to have a perception of the practices and phases that have experienced the greatest changes. Additionally, it aims to identify a set of good practices that can be adopted by software engineering companies. Design/methodology/approach This study uses a qualitative methodology through four case studies involving Portuguese software engineering companies. Two of these companies are small and medium enterprises (SMEs) while the other remaining two are micro-companies. The thematic analysis is adopted to identify patterns in the performed interviews. Findings The findings indicate that significant changes have occurred at all stages of software development. In particular, the initial stages of identifying requirements and modeling processes were the stages that experienced the greatest changes. On the opposite, the technical development phase has not noticeably changed but, nevertheless, it is necessary to look at the importance of training software developers for GDPR rules and practices. Research limitations/implications Two relevant limitations were identified as follows: only four case studies involving micro-companies and SMEs were considered, and only the traditional software development methodology was considered. The use of agile methodologies was not explored in this study and the findings can only be mainly applied to the waterfall model. Originality/value This study offers mainly practical contributions by identifying a set of challenges that are posed to software engineering companies by the implementation of GDPR. Through their knowledge, it is expected to help these companies to better prepare themselves and anticipate the challenges they will necessarily face.

Abstract
OBJECTIVES: Existing individual-level human data cover large populations on many dimensions such as lifestyle, demography, laboratory measures, clinical parameters, etc. Recent years have seen large investments in data catalogues to FAIRify data descriptions to capitalise on this great promise, i.e. make catalogue contents more Findable, Accessible, Interoperable and Reusable. However, their valuable diversity also created heterogeneity, which poses challenges to optimally exploit their richness. METHODS: In this opinion review, we analyse catalogues for human subject research ranging from cohort studies to surveillance, administrative and healthcare records. RESULTS: We observe that while these catalogues are heterogeneous, have various scopes, and use different terminologies, still the underlying concepts seem potentially harmonizable. We propose a unified framework to enable catalogue data sharing, with catalogues of multi-center cohorts nested as a special case in catalogues of real-world data sources. Moreover, we list recommendations to create an integrated community of metadata catalogues and an open catalogue ecosystem to sustain these efforts and maximise impact. CONCLUSIONS: We propose to embrace the autonomy of motivated catalogue teams and invest in their collaboration via minimal standardisation efforts such as clear data licensing, persistent identifiers for linking same records between catalogues, minimal metadata 'common data elements' using shared ontologies, symmetric architectures for data sharing (push/pull) with clear provenance tracks to process updates and acknowledge original contributors. And most importantly, we encourage the creation of environments for collaboration and resource sharing between catalogue developers, building on international networks such as OpenAIRE and research data alliance, as well as domain specific ESFRIs such as BBMRI and ELIXIR. IMIA and Thieme. This is an open access article published by Thieme under the terms of the Creative Commons Attribution-NonDerivative-NonCommercial License, permitting copying and reproduction so long as the original work is given appropriate credit. Contents may not be used for commercial purposes, or adapted, remixed, transformed or built upon. (https://creativecommons.org/licenses/by-nc-nd/4.

Abstract
This paper describes the development of a mechanism to deal with time windows constraints. To the best of our knowledge, the time windows constraints are difficult to be fulfilled even for state-of-the-art methods. Therefore, the main contribution of this paper is to propose a new computational technique to deal with such constraints to ensure the algorithm convergence. We test such technique in two metaheuristics to solve the discrete and dynamic Berth Allocation Problem. A data set generator was created, resulting in a diversity of problems in terms of time windows constraints. A detailed computational analysis was carried out to compare the performance for each metaheuristic.

Abstract
During the recent years, the power system has entered a new technological era. The trends associated with increased commitment to wind farms (WFs) and energy storage systems (ESSs) as well demand side flexibility require disruptive changes in the existing power system structures and procedures. Being at the heart of a paradigm shift from passive users of the grid to active prosumers, storage owners and demand responsive actors, this paper expresses a flexible coordinated power system expansion planning (CPSEP) while considering local WFs, ESSs and incentive-based demand response programs (DRPs). This model minimizes the summation of the expansion planning, operation and reliability costs while taking the network model based on AC optimal power flow constraints, and the reliability and flexibility considerations into account. The proposed framework is firstly formulated by mixed integer non-linear programming (MINLP), then to have a well-handed optimization model it is converted to mixed integer linear programming (MILP). Additionally, the uncertainties of load, energy price, maximum WF generation and availability/unavailability of the network equipment are included in the proposed model where the first three parameters are modeled based on the bounded uncertainty-based robust optimization (BURO), and the scenario-based stochastic programming (SBSP) is used to model the last uncertain parameter. Finally, the proposed method is examined on several test networks to assess the performance of the proposed framework for flexi-reliable transmission network operation and planning.

Abstract
The technological market is increasingly evolving as evidenced by the innovative and streamlined manufacturing processes. Printed Circuit Boards (PCB) are widely employed in the electronics fabrication industry, resorting to the Gerber open standard format to transfer the manufacturing data. The Gerber format describes not only metadata related to the manufacturing process but also the PCB image. To be able to map the electronic circuit pattern to be printed, a parser to convert Gerber files into a bitmap image is required. The current literature as well as available Gerber viewers and libraries showed limitations mainly in the Gerber format support, focusing only on a subset of commands. In this work, the development of a recursive descent approach for parsing Gerber files is described, outlining its interpretation and the renderization of 2D bitmap images. All the defined commands in the specification based on Gerber X2 generation were successfully rendered, unlike the tested commercial parsers used in the experiments. Moreover, the obtained results were comparable to those parsers regarding the commands they can execute as well as the ground-truth, emphasizing the accuracy of the proposed approach. Its top-down and recursive architecture allows easy integration with other software regardless of the platform, highlighting its potential inclusion and integration in the production of electronic circuits.