Lexi-Term : approches plurielles de la lexicographie spécialisée et de la terminologie/terminographie

Ce numéro de R.I.L.A. ‒ Rassegna Italiana di Linguistica Applicata, sur Lexi-Term : approches plurielles de la lexicographie spécialisée et de la terminologie/terminographie, naît de l’intérêt que le Groupe de Recherche Modena Lexi-Term porte à la lexicographie spécialisée, à la terminologie et à la terminographie mono- et bilingues, ainsi qu’à l’étude du comportement des termes en contexte, étroitement liée à l’analyse de corpus de textes authentiques. aduzione giuridica

Conclu* in English and Italian historical research articles

This paper integrates the tools of corpus linguistics and a more genre-oriented perspective in order to explore the lemmatizations of conclu* in the Conclusions of English and Italian research articles in history. Specifically, the main emphasis is placed on second-level Summarizers and concluders (Siepmann 2005) and the way they interact with other discourse markers and metadiscourse across moves. As will be seen, SLDMs represent a marked option,in that they add extra-meaning to their more general, more transparent, more frequent, and lessspecific counterparts. Whereas variation within the unit or pattern results from combinations with discourse markers from the same or other categories, variation across English and Italian isbetter accounted for within an interpersonal model of metadiscourse (Hyland 2004, 2008), interms of different strategies on the interactional level

Webpage usability and utility content: Citizens' rights and the law on Gov.uk

The goal of this descriptive study is to investigate the visual and written representation of legal knowledge in selected articles and directories of the Gov.uk platform, which transmits and mediates legal knowledge from the UK Government and Ministry of Justice as institutional principals to individual citizens. The data suggests that the Your rights and the law pages at Gov.uk are able to deliver good value to the end-user (i.e. knowledge) and to the institution (in terms of credibility and trust generation). Written mediation of legal knowledge through the Your rights and the law pages at Gov.uk, we have seen, comes with recourse to interdiscursive and interlocutive dialogic devices. Oftentimes, expository reformulations resemble lexicographic definitions in dictionary articles: they may come in diverse combinations and vary according to the direction of the definition, type (analytical or by function), present or absent relational expressions, etc. This involves reconceptualization of terms from source discourses and approximations to specialized meanings. From a usability point of view, the Your rights and the law pages appear to qualify as mature information formats and a powerful means for knowledge construction and representation, as well as engagement and interaction with end-users (GDS-a, GDS-b). They satisfy the standard criteria for usable user interfaces – layout consistency, meaningful headings, itemized keywords and hierarchical organization of expandable content, clear signposting and multiple access routes, etc. Accordingly, information is diluted across pages, and content often graphically schematized into bulleted lists that separate and fix subordinate components on the page. This demonstrates a major concern with the graphic/visual organization of expandable utility content, which is a major prerequisite for encouraging users to turn to the Gov.uk platform rather than other sources for basic self-help, services and documentation

A branch-and-price approach for solving the train unit scheduling problem

We propose a branch-and-price approach for solving the integer multicommodity flow model for the network-level train unit scheduling problem (TUSP). Given a train operator’s fixed timetable and a fleet of train units of different types, the TUSP aims at determining an assignment plan such that each train trip in the timetable is appropriately covered by a single or coupled train units. The TUSP is challenging due to its complex nature. Our branch-and-price approach includes a branching system with multiple branching rules for satisfying real-world requirements that are difficult to realize by linear constraints, such as unit type coupling compatibility relations and locations banned for coupling/decoupling. The approach also benefits from an adaptive node selection method, a column inheritance strategy and a feature of estimated upper bounds with node reservation functions. The branch-and-price solver designed for TUSP is capable of handling instances of up to about 500 train trips. Computational experiments were conducted based on real-world problem instances from First ScotRail. The results are satisfied by rail practitioners and are generally competitive or better than the manual ones

Train unit scheduling guided by historic capacity provisions and passenger count surveys

Train unit scheduling concerns the assignment of train unit vehicles to cover all the journeys in a fixed timetable. Coupling and decoupling activities are allowed in order to achieve optimal utilization while satisfying passenger demands. While the scheduling methods usually assume unique and well-defined train capacity requirements, in practice most UK train operators consider different levels of capacity provisions. Those capacity provisions are normally influenced by information such as passenger count surveys, historic provisions and absolute minimums required by the authorities. In this paper, we study the problem of train unit scheduling with bi-level capacity requirements and propose a new integer multicommodity flow model based on previous research. Computational experiments on real-world data show the effectiveness of our proposed methodology

A Fast Heuristic Algorithm for the Train Unit Assignment Problem

In this paper we study a railway optimization problem known as the Train Unit Assignment Problem. A train unit consists of a self-contained train with an engine and a set of wagons with passenger seats. Given a set of timetabled train trips, each with a required number of passenger seats, and a set of train units, each with a given number of available seats, the problem calls for the best assignment of the train units to the trips, possibly combining more than one train unit for a given trip, that fulfills the seat requests. We propose a heuristic algorithm based on the computation of a lower bound obtained by solving an Integer Linear Programming model that gives the optimal solution in a "peak period" of the day. The performance of the heuristic algorithm is computationally evaluated on real-world instances provided by a regional Italian Train Operator. The results are compared with those of existing methods from the literature, showing that the new method is able to obtain solutions of good quality in much shorter computing times

Recoverable Robustness for Railway Rolling Stock Planning

In this paper we explore the possibility of applying the notions of Recoverable Robustness and Price of Recoverability (introduced by [5]) to railway rolling stock planning, being interested in recoverability measures that can be computed in practice, thereby evaluating the robustness of rolling stock schedules. In order to lower bound the Price of Recoverability for any set of recovery algorithms, we consider an "optimal" recovery algorithm and propose a Benders decomposition approach to assess the Price of Recoverability for this "optimal" algorithm. We evaluate the approach on real-life rolling stock planning problems of NS, the main operator of passenger trains in the Netherlands. The preliminary results show that, thanks to Benders decomposition, our lower bound can be computed within relatively short time for our case study