Abstract
Na viragem do milénio, decorrentes sobretudo do Processo de Bolonha e da (r)evolução tecnológica, colocaram-se ao Ensino Superior e aos docentes vários desafios, nomeadamente os relacionados com questões pedagógicas. Tendo essa situação por referência, o artigo apresenta um estudo que analisou a produção académica em Portugal entre 2012-2021, pesquisada com recurso a diversas bases de dados e interpretada por técnicas de análise de frequência e de conteúdo. A análise evidenciou que: o número de artigos publicados em revistas indexadas ou em atas de conferências não foi tão expressivo como a urgência da reflexão que a temática merecia; o número de teses de doutoramento e dissertações de mestrado com foco nas questões pedagógicas no Ensino Superior foi relativamente reduzido; a metodologia desses trabalhos, embora distribuída entre procedimentos de orientação qualitativa, mista e quantitativa, teve menor expressão neste último tipo metodológico; muitos dos autores dos trabalhos académicos são do campo educacional, embora existam também autores de outras áreas científicas; a maior parte dos trabalhos académicos teve como foco a formação pedagógica dos docentes do Ensino Superior, a que se seguiram estudos relativos a práticas pedagógicas e a desafios colocados ao Ensino Superior. A par dessas conclusões, o estudo permitiu identificar limitações que justificam o seu aprofundamento, mas também recomendações para futuros trabalhos de investigação sobre essa temática.

Abstract
Finite-State Automata (FSA) are foundations for modelling, synthesis, verification, and implementation of controllers for manufacturing systems. However, FSA are limited to represent emerging features in manufacturing, such as the ability to recognise and switch contexts. One option is to enrich FSA with parameters that carry details about the manufacturing, which may favour design and control. A parameter can be embedded either on transitions or states of an FSA, and each approach defines its own modelling framework, so that their comparison and integration are not straightforward, and they may lead to different control solutions, modelled, processed and implemented distinctly. In this paper, we show how to combine advantages from parameters in manufacturing the modelling and control. We initially present a background that allows to understand each parameterisation strategy. Then, we introduce a conversion method that translates a design-friendly model into a synthesis-efficient structure. Finally, we use the converted models is synthesis, highlighting their advantages. Examples are used throughout the paper to illustrate and compare our results and tooling support is also provided.

Abstract

Abstract

Abstract
In the context of intuitionistic sequent calculus, naturality means permutation-freeness (the terminology is essentially due to Mints). We study naturality in the context of the lambda-calculus with generalized applications and its multiary extension, to cover, under the Curry-Howard correspondence, proof systems ranging from natural deduction (with and without general elimination rules) to a fragment of sequent calculus with an iterable left-introduction rule, and which can still be recognized as a call-by-name lambda-calculus. In this context, naturality consists of a certain restricted use of generalized applications. We consider the further restriction obtained by the combination of naturality with normality w.r.t. the commutative conversion engendered by generalized applications. This combination sheds light on the interpretation of naturality as a vectorization mechanism, allowing a multitude of different ways of structuring lambda-terms, and the structuring of a multitude of interesting fragments of the systems under study. We also consider a relaxation of naturality, called weak naturality: this not only brings similar structural benefits, but also suggests a new weak system of natural deduction with generalized applications which is exempt from commutative conversions. In the end, we use all of this evidence as a stepping stone to propose a computational interpretation of generalized application (whether multiary or not, and without any restriction): it includes, alongside the argument(s) for the function, a general list - a new, very general, vectorization mechanism, that structures the continuation of the computation.(c) 2022 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

Abstract
Sectorization is concerned with dividing a large territory into smaller areas, also known as sectors. This process usually simplifies a complex problem, leading to easier solution approaches to solving the resulting subproblems. Sectors are built with several criteria in mind, such as equilibrium, compactness, contiguity, and desirability, which vary with the applications. Sectorization appears in different contexts: sales territory design, political districting, healthcare logistics, and vehicle routing problems (agrifood distribution, winter road maintenance, parcel delivery). Environmental problems can also be tackled with a sectorization approach; for example, in municipal waste collection, water distribution networks, and even in finding more sustainable transportation routes. This work focuses on sectorization concerning the location of the area's centers and allocating basic units to each sector. Integer programming models address the location-allocation problems, and various formulations implementing different criteria are compared. Methods to deal with multiobjective optimization problems, such as the e-constraint, the lexicographic, and the weighted sum methods, are applied and compared. Computational results obtained for a set of benchmarking instances of sectorization problems are also presented.