Search results for " Computer Science"
showing 10 items of 3983 documents
The directed profitable rural postman problem with incompatibility constraints
2017
[EN] In this paper, we study a variant of the directed rural postman problem (RPP) where profits are asso- ciated with arcs to be served, and incompatibility constraints may exist between nodes and profitable arcs leaving them. If convenient, some of the incompatibilities can be removed provided that penalties are paid. The problem looks for a tour starting and ending at the depot that maximizes the difference between collected profits and total cost as sum of traveling costs and paid penalties, while satisfying remaining incompatibilities. The problem finds application in the domain of road transportation service, and in particular in the context of horizontal collaboration among carriers …
The periodic rural postman problem with irregular services on mixed graphs
2019
Abstract In this paper, we deal with an extension of the rural postman problem in which some links of a mixed graph must be traversed a given number of times over a time horizon. These links represent entities that must be serviced a specified number of times in some subsets of days (or periods) of the time horizon. The aim is to design a set of minimum-cost tours, one for each day/period of the time horizon, that satisfy the service requirements. We refer to this problem as the periodic rural postman problem with irregular services (PRPP–IS). Some practical applications of the problem can be found in road maintenance operations and road network surveillance, for example. In order to solve …
Availability, demand, perceived constraints and disuse of ADAS technologies in Spain: findings from a national study
2019
Advanced Driver Assistance Systems (ADAS), created for enhancing the driving experience and actively preventing road crashes, have been progressively incorporated in vehicle designing essentially during the last decade. However, the literature has shown how some of these assisting technologies are not used by drivers in tandem with their potential. The aims of this study were, first, to examine the availability and demand of ADAS technologies among Spanish drivers and, secondly, to explore the perceived constraints and discouraging reasons for avoiding the use of ADAS available in their vehicles. For this national cross-sectional study, data from 1,207 Spanish drivers were analyzed. The res…
Les apports du modèle de recherches d'expériences à l'analyse du comportement dans le domaine culturel Une exploration conceptuelle et méthodologique
1995
International audience; Le modèle de recherche d'expériences de Holbrook et Hirschman a été présenté par ses auteurs comme un cadre conceptuel bien adapté à l'analyse des comportements dans le domaine culturel. Cette recherche analyse la capacité de variables explicatives des différences interindividuelles retenues par ce modèle à expliquer des différences dans les évocations affectives du théâtre par le public. La méthodologie mise en œuvre s'appuie sur l'analyse statistique de données textuelles recueillies auprès des différents segments de spectateurs.
Packing colorings of subcubic outerplanar graphs
2018
Given a graph $G$ and a nondecreasing sequence $S=(s_1,\ldots,s_k)$ of positive integers, the mapping $c:V(G)\longrightarrow \{1,\ldots,k\}$ is called an $S$-packing coloring of $G$ if for any two distinct vertices $x$ and $y$ in $c^{-1}(i)$, the distance between $x$ and $y$ is greater than $s_i$. The smallest integer $k$ such that there exists a $(1,2,\ldots,k)$-packing coloring of a graph $G$ is called the packing chromatic number of $G$, denoted $\chi_{\rho}(G)$. The question of boundedness of the packing chromatic number in the class of subcubic (planar) graphs was investigated in several earlier papers; recently it was established that the invariant is unbounded in the class of all sub…
Quine’s Fluted Fragment is Non-elementary
2016
We study the fluted fragment, a decidable fragment of first-order logic with an unbounded number of variables, originally identified by W.V. Quine. We show that the satisfiability problem for this fragment has non-elementary complexity, thus refuting an earlier published claim by W.C. Purdy that it is in NExpTime. More precisely, we consider, for all m greater than 1, the intersectionof the fluted fragment and the m-variable fragment of first-order logic. We show that this subfragment forces (m/2)-tuply exponentially large models, and that its satisfiability problem is (m/2)-NExpTime-hard. We round off by using a corrected version of Purdy’s construction to show that the m-variable fluted f…
On the relation of irony, understatement, and litotes
2016
The aim of this paper is to clarify the distinctive and the shared features of the three phenomena: irony, understatement, and litotes. These rhetorical figures have been defined as synonymous, distinct or overlapping in various accounts. This indicates an interrelation but also a need for clearer definitions. Here, each of these rhetorical figures is defined via two jointly necessary conditions. This approach sharpens the categories, enables clear-cut distinctions and helps to explain cases of overlap. German corpus data and examples from the literature as a basis, allow differentiating between cases of understatement as a means of irony, and cases of litotes as a means of understatement. …
Aspects of a theory of bullshit
2016
This paper addresses the question whetherbullshitis a reasonable pragmatic category. In the first part of the paper, drawing on the insights of Harry Frankfurt’s seminal essay, bullshit is defined as an act of insincere asserting where the speaker shows (a) a loose concern for the truth, and (b) does not want the addressee to become aware of condition (a). The author adds to this definition the condition (c) requiring that the bullshitter expresses morecertaintythan is adequate with respect to condition (a). In the second part of the paper, it is discussed whether the above definition can cope with special types of bullshit considered to be a challenge to Frankfurt’s definition. These areev…
Modelling of Systems for Real
2016
Modelling and Programming are often used together in system development. However, typically there is a large difference between the handling of modelling parts and the handling of programming parts. This leads to the fact that the transition between the two is not easy, and important information is lost as well as extra information has to be provided when combining modelling and programming. This paper shows how modelling and programming could work together in system development.
Retrieving Monitoring and Accounting Information from Constrained Devices in Internet-of-Things Applications
2013
Part 6: Monitoring Mechanisms; International audience; Internet-of-Things (IoT) is envisioned to provide connectivity to a vast number of sensing or actuating devices with limited computational and communication capabilities. For the organizations that manage these constrained devices, the monitoring of each device’s operational status and performance level as well as the accounting of their resource usage are of great importance. However, monitoring and accounting support is lacking in today’s IoT platforms. Hence, this paper studies the applicability of the Constrained Application Protocol (CoAP), a lightweight transfer protocol under development by IETF, for efficiently retrieving monito…