Search results for "Programming"
showing 10 items of 3090 documents
Sensorial discourse and corpus in the digital humanities era: The example of the wine language
2019
International audience; This article intends to define sensorial discourses, to discuss the way they should be analyzed by stressing the importance of corpora. Putting these thoughts into the context of the digital revolution, it will show how corpora should evolve in the digital humanities. The association of digital and sensorial discourses needs to be clarified and this article proposes a way to find new approaches to better analyze them.
Some reflections on semantic–pragmatic cycles
2020
Abstract This paper explores novel ways to consider semantic–pragmatic cycles using a dual strategy: an inwards strategy, whereby the distinctive traits of a pragmatic cycle are established, and an outwards strategy, whereby the categories that delimit semantic–pragmatic cycles are described. The result of this exploration is the distinction between “pragmatic cycle”, “replication”, “concomitance” and “paradigmatic increase” as four different yet related processes. In addition, this study integrates Construction Grammar into the description of each process and shows that the study of semantic–pragmatic cycles can benefit from a constructional approach, adopting Traugott and Trousdale’s (201…
A reflection on the translation of sex-related language in audio-visual texts: the Spanish version of J.K. Rowling’sThe Casual Vacancy
2018
Studies on the way sex-related language has been approached in audio-visual translation are still rather limited. This article documents the range of solutions given in Spanish to the sex-related l...
If you can defend your own point of view, you're good : Norms of voice construction in student writing on an international Master's programme
2019
Abstract This ethnographically oriented study followed the writing experiences of four students on an international masters programme in Finland. Gathering a range of data, the study set out to examine what counts as good writing on a programme with a very diverse student body in which English is used as a lingua franca. Both teachers and students emphasised the importance of arguing one's ‘own point of view’ in academic writing, and teachers often formed impressions of students on the basis of their texts, drawing attention particularly to their use of metadiscourse markers (e.g., self-mentions, attitude markers and hedges). The present article therefore combines a quantitative analysis of…
Generating incremental type services
2019
In this vision paper, we propose a method for generating fully functional incremental type services from declarations of type rules. Our general strategy is to translate type rules into Datalog, for which efficient incremental solvers are already available. However, many aspects of type rules don't naturally translate to Datalog and need non-trivial translation. We demonstrate that such translation may be feasible by outlining the translation rules needed for a language with typing contexts (name binding) and bidirectional type rules (local type inference). We envision that even rich type systems of DSLs can be incrementalized by translation to Datalog in the future.
Reducing disruptive behaviours and improving classroom behavioural climate with class-wide positive behaviour support in middle schools
2017
Disruptive behaviour in classrooms is a significant challenge for learning in schools and a risk factor for students’ academic achievement and a significant source of teachers’ work-related stress. Earlier research shows that clear behavioural expectations, monitoring students’ adherence to them and behaviour-specific praise are effective practices to reduce disruptive behaviour. Although behaviour problems are common in middle schools, most of the interventions have been developed and studied in elementary schools. This randomised study evaluated the effects of a class-wide intervention on classroom behavioural climate and disruptive behaviour, on teacher-experienced stress and on the time…
Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models
2020
Variable fixing by reduced costs is a popular technique for accelerating the solution process of mixed-integer linear programs. For vehicle-routing problems solved by branch-price-and-cut algorithms, it is possible to fix to zero the variables associated with all routes containing at least one arc from a subset of arcs determined according to the dual solution of a linear relaxation. This is equivalent to removing these arcs from the network used to generate the routes. In this paper, we extend this technique to routes containing sequences of two arcs. Such sequences or their arcs cannot be removed directly from the network because routes traversing only one arc of a sequence might still b…
‘Tool port’ to ‘landlord port’: a game theory approach to analyse gains from governance model transformation
2018
This study investigates potential port users’ surplus and terminal operators’ profits due to transforming port governance from the ‘tool port’ model to the ‘landlord port’ model. Although the landl...
Relative Reachability Analysis as a Tool for Urban Mobility Planning
2019
There is a plethora of user-oriented route planning applications and systems that enable the computation of the fastest journey between two locations using different transportation modes, e.g., car, public transport, walking, bicycle. While useful for individuals, they are of limited interest to a class of users that may be interested in a more global and comparative view of transportation systems in general. In this context, we adopt the view of an urban planner. Urban planners may be interested in queries such as "if a new transit stop was to be introduced in a given location, would that bring the travel time to a given point-of-interest (POI) or area-of-interest (AOI) by bus closer to th…
A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations
2021
AbstractThe Green Vehicle Routing Problem with Capacitated Alternative Fuel Stations assumes that, at each station, the number of vehicles simultaneously refueling cannot exceed the number of available pumps. The state-of-the-art solution method, based on the generation of all feasible non-dominated paths, performs well only with up to 2 pumps. In fact, it needs cloning the paths between every pair of pumps. To overcome this issue, in this paper, we propose new path-based MILP models without cloning paths, for both the scenario with private stations (i.e., owned by the fleet manager) and that with public stations. Then, a more efficient cutting plane approach is designed for addressing both…