Abstract

Abstract

Abstract
Higher education is a complex business including very different process. At its core are the teaching and research processes and along the edge of the business model are the administrative processes, targeted to the students and alumni. Some of these processes translate into services that must be available during the whole life of the users and the institutions. For example, a higher education institution is expected to issue diplomas during the whole lifetime of its former students. In this context, we've been working in order to use the current e-government infrastructure of electronic services as building blocks for some of the features of the higher education institution electronic services. This work proposes the adoption of a set of those services. We've concluded a successful testing stage and expect to deploy a full production system very soon. Copyright

Abstract
Portugal, as part of the European Union, has general legislation regarding accessibility and inclusion for general purposes, particularly for education. There are several international and national initiatives, including some projects. However, disabled and non-disabled people still do not share equal opportunities. In this project a proposal for a remote class system is presented, which includes sign language interpretation, targeted at those students who cannot be physically present in the classroom and/or need sign language interpretation. The system is based on audio and video communication between the classroom, the student and an interpreter, so that the student can access and understand the content of the class in real-time, as well as be able to interact with the professor and classmates. A prototype is being developed in conjunction with the Portugal Telecom Foundation, which should be a step forward to a new full-featured service targeted at educational institutions and disabled students. © Springer International Publishing AG, part of Springer Nature 2018.

Abstract
Linking an expert to his knowledge areas is still a challenging research problem. The task is usually divided into two steps: identifying the knowledge areas/topics in the text corpus and assign them to the experts. Common approaches for the expert profiling task are based on the Latent Dirichlet Allocation (LDA) algorithm. As a result, they require pre-defining the number of topics to be identified which is not ideal in most cases. Furthermore, LDA generates a list of independent topics without any kind of relationship between them. Expert profiles created using this kind of flat topic lists have been reported as highly redundant and many times either too specific or too general. In this paper we propose a methodology that addresses these limitations by creating hierarchical expert profiles, where the knowledge areas of a researcher are mapped along different granularity levels, from broad areas to more specific ones. For the purpose, we explore the rich structure and semantics of Heterogeneous Information Networks (HINs). Our strategy is divided into two parts. First, we introduce a novel algorithm that can fully use the rich content of an HIN to create a topical hierarchy, by discovering overlapping communities and ranking the nodes inside each community. We then present a strategy to map the knowledge areas of an expert along all the levels of the hierarchy, exploiting the information we have about the expert to obtain an hierarchical profile of topics. To test our proposed methodology, we used a computer science bibliographical dataset to create a star-schema HIN containing publications as star-nodes and authors, keywords and ISI fields as attribute-nodes. We use heterogeneous pointwise mutual information to demonstrate the quality and coherence of our created hierarchies. Furthermore, we use manually labelled data to serve as ground truth to evaluate our hierarchical expert profiles, showcasing how our strategy is capable of building accurate profiles. © 2018, Springer Nature Switzerland AG.

Abstract
This paper gives a comprehensive and coherent view on permutability in the intuitionistic sequent calculus with cuts. Specifically we show that, once permutability is packaged into appropriate global reduction procedures, it organizes the internal structure of the system and determines fragments with computational interest, both for the computation-as-proof-normalization and the computation-as-proof-search paradigms. The vehicle of the study is a ?-calculus of multiary proof terms with generalized application, previously developed by the authors (the paper argues this system represents the simplest fragment of ordinary sequent calculus that does not fall into mere natural deduction). We start by adapting to our setting the concept of normal proof, developed by Mints, Dyckhoff, and Pinto, and by defining natural proofs, so that a proof is normal iff it is natural and cut-free. Natural proofs form a subsystem with a transparent Curry- Howard interpretation (a kind of formal vector notation for -terms with vectors consisting of lists of lists of arguments), while searching for normal proofs corresponds to a slight relaxation of focusing (in the sense of LJT). Next, we define a process of permutative conversion to natural form, and show that its combination with cut elimination gives a concept of normalization for the sequent calculus. We derive a systematic picture of the full system comprehending a rich set of reduction procedures (cut elimination, flattening, permutative conversion, normalization, focalization), organizing the relevant subsystems and the important subclasses of cut-free, normal, and focused proofs. © José Espírito Santo, Maria João Frade, and Luís Pinto; licensed under Creative Commons License CC-BY 22nd International Conference on Types for Proofs and Programs (TYPES 2016).