Focalisation and Classical Realisability (version with appendices)

The original publication is avalaible at : www.springerlink.comInternational audienceWe develop a polarised variant of Curien and Herbelin's lambda-bar-mu-mu-tilde calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised when cut-free), such as Girard's classical logic LC or linear logic. This gives a setting in which Krivine's classical realisability extends naturally (in particular to call-by-value), with a presentation in terms of orthogonality. We give examples of applications to the theory of programming languages

Do optional activities matter in virtual learning environments?

Virtual Learning Environments (VLEs) provide students with activi-ties to improve their learning (e.g., reading texts, watching videos or solving exercises). But VLEs usually also provide optional activities (e.g., changing an avatar profile or setting goals). Some of these have a connection with the learn-ing process, but are not directly devoted to learning concepts (e.g., setting goals). Few works have dealt with the use of optional activities and the relation-ships between these activities and other metrics in VLEs. This paper analyzes the use of optional activities at different levels in a specific case study with 291 students from three courses (physics, chemistry and mathematics) using the Khan Academy platform. The level of use of the different types of optional ac-tivities is analyzed and compared to that of learning activities. In addition, the relationship between the usage of optional activities and different student be-haviors and learning metrics is presented

Сутність та класифікація ризиків інвестиційної діяльності

Наводиться визначення поняттю "ризики інвестиційної діяльності" за рахунок поєднання його сутнісних характеристик, виконано узагальнення класифікації цих ризиків, запропоновано введення нової класифікаційної групи – "корпоративні ризики", які пов'язані з можливістю втрати контролю над підприємством інвестором-акціонером

General-elimination stability

General-elimination harmony articulates Gentzen's idea that the elimination-rules are justified if they infer from an assertion no more than can already be inferred from the grounds for making it. Dummett described the rules as not only harmonious but stable if the E-rules allow one to infer no more and no less than the I-rules justify. Pfenning and Davies call the rules locally complete if the E-rules are strong enough to allow one to infer the original judgement. A method is given of generating harmonious general-elimination rules from a collection of I-rules. We show that the general-elimination rules satisfy Pfenning and Davies' test for local completeness, but question whether that is enough to show that they are stable. Alternative conditions for stability are considered, including equivalence between the introduction- and elimination-meanings of a connective, and recovery of the grounds for assertion, finally generalizing the notion of local completeness to capture Dummett's notion of stability satisfactorily. We show that the general-elimination rules meet the last of these conditions, and so are indeed not only harmonious but also stable.Publisher PDFPeer reviewe

Modification de la spécificité de la transglutaminase par une approche semi-aléatoire : un nouvel outil pour la synthèse des peptides

Thèse numérisée par la Direction des bibliothèques de l'Université de Montréal

Strong cut-elimination systems for Hudelmaier’s depth-bounded sequent calculus for implicational logic

Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicational case, thus strengthening existing approaches to Cut-admissibility. We decorate proofs with proofterms and introduce various term-reduction systems representing proof transformations. In contrast to previous papers which gave different arguments for Cut-admissibility suggesting weakly normalising procedures for Cut-elimination, our main reduction system and all its variations are strongly normalising, with the variations corresponding to different optimisations, some of them with good properties such as confluence

Modelos de programação inteira mista para o planejamento do corte unidimensional de tubos metálicos na indústria aeronáutica agrícola Mixed integer programming models for the planning of one-dimensional metallic pipe cutting in the aeronautics industry

Este trabalho busca otimizar o planejamento do processo de corte unidimensional de tubos estruturais metálicos utilizados na fabricação de aeronaves leves agrícolas. Dois modelos de programação linear inteira mista são apresentados com o objetivo de minimizar as perdas do material cortado e considerando a possibilidade de gerar sobras com tamanhos suficientes para reaproveitamento (retalhos). Os modelos são resolvidos por meio de uma linguagem de modelagem usando um software de otimização. Para a validação dos modelos, dois experimentos computacionais foram realizados com dados reais de uma carteira de pedidos de uma aeronave leve voltada para o segmento do mercado agrícola, o Ipanema, produzido pela empresa brasileira Neiva/Embraer. As soluções dos modelos são comparadas com as soluções de uma heurística residual de arredondamento guloso da literatura e também com as soluções utilizadas pela empresa. Os resultados mostram que os modelos são úteis para apoiar as decisões envolvidas no planejamento deste processo de corte.<br>This study aims to optimize the one-dimensional cutting process planning of structural metallic tubes used to build agricultural light aircrafts. Two mixed integer linear programming models are presented to minimize the waste of material cut and considering the possibility of generating surpluses with sizes sufficiently large for reuse (leftovers). The models are solved using a commercial modeling language and an optimization solver. For the validation of the models, two computational experiments were performed with actual data from the portfolio of a light aircraft designed for agricultural purposes, the Ipanema, produced by the Brazilian company Neiva/Embraer. The solutions of the models are compared with the solutions of a constructive heuristic of the literature and the solutions used by the company. The results show that the models are useful for being used in the planning of this cutting process