Search results for "Discrete"
showing 10 items of 2205 documents
A competing risks tale on successful and unsuccessful fiscal consolidations
2019
Abstract This paper analyses the transitions out of fiscal consolidations using annual data for 17 industrial countries over the period 1975-2013 and applying a discrete-time competing risks duration model. Our approach allows us to distinguish the factors behind a successful or an unsuccessful end of fiscal consolidation episodes. The results show that economic and political factors, the size and typology of fiscal adjustments and the occurrence of crises explain the differences in the length and the success/failure of fiscal consolidations. Moreover, while fiscal adjustment programmes that end successfully display positive duration dependence, those that end in an unsuccessful manner are …
On the "Strength" of Behavior.
2020
AbstractThe place of the concept of response strength in a natural science of behavior has been the subject of much debate. This article reconsiders the concept of response strength for reasons linked to the foundations of a natural science of behavior. The notion of response strength is implicit in many radical behaviorists’ work. Palmer (2009) makes it explicit by applying the response strength concept to three levels: (1) overt behavior, (2) covert behavior, and (3) latent or potential behavior. We argue that the concept of response strength is superfluous in general, and an explication of the notion of giving causal status to nonobservable events like latent behavior or response strengt…
The potential impact of Brexit on Ireland's demand for shipping services to continental Europe
2018
Abstract Ireland, as an island nation, has historically relied on the UK landbridge to export and import its goods to and from Europe. This provides a fast, reliable and secure service along the UK landbridge route relative to the more economical and less frequent direct continental route. However, the relative competitiveness of maritime services along both routes may be significantly influenced by the UK exit from the European Union or Brexit. This paper aims to understand the potential impact of Brexit on maritime freight transport demand from Ireland to continental Europe for export trade shipments. Based on data collected from an efficient stated preference (SP) experiment, discrete ch…
Discrete Choice Methods with Simulation
2016
Discrete Choice Methods with Simulation by Kenneth Train has been available in the second edition since 2009. The book is published by Cambridge University Press and is also available for download ...
Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
2017
Abstract With their paper “Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints” [Discrete Optimization 3, 2006, pp. 255–273] Righini and Salani introduced bounded bidirectional dynamic programming (DP) as an acceleration technique for solving variants of the shortest path problem with resource constraints (SPPRC). SPPRCs must be solved iteratively when vehicle routing and scheduling problems are tackled via Lagrangian relaxation or column-generation techniques. Righini and Salani and several subsequent works have shown that bounded bidirectional DP algorithms are often superior to their monodirectional counterparts, s…
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…
Miscellaneous Graph Preliminaries
2020
Summary This article contains many auxiliary theorems which were missing in the Mizar Mathematical Library [2] to the best of the author’s knowledge. Most of them regard graph theory as formalized in the GLIB series (cf. [8]) and most of them are preliminaries needed in [7] or other forthcoming articles.
"Table 30" of "Search for long-lived particles produced in $pp$ collisions at $\sqrt{s}=13$ TeV that decay into displaced hadronic jets in the ATLAS …
2018
Barrel MS vertex efficiencies (in %) for baryogenesis $\chi \rightarrow \nu b \bar{b}$ benchmark samples ($m_{h}=125$ GeV). The vertex reconstruction efficiency is defined as the fraction of simulated LLP decays in the MS fiducial volume that match a reconstructed vertex ($\Delta R(\textrm{LLP,vertex}) = 0.4$) passing the baseline event selection and satisfying the vertex isolation criteria. A vertex is considered matched to a displaced decay if the vertex is within $\Delta R = 0.4$ of the simulated decay position. The MS vertex efficiency is parameterized as a function of the LLP decay position.
"Table 41" of "Search for long-lived particles produced in $pp$ collisions at $\sqrt{s}=13$ TeV that decay into displaced hadronic jets in the ATLAS …
2018
Endcap MS vertex efficiencies (in %) for baryogenesis $\chi \rightarrow \nu b \bar{b}$ benchmark samples ($m_{h}=125$ GeV). The vertex reconstruction efficiency is defined as the fraction of simulated LLP decays in the MS fiducial volume that match a reconstructed vertex ($\Delta R(\textrm{LLP,vertex}) = 0.4$) passing the baseline event selection and satisfying the vertex isolation criteria. A vertex is considered matched to a displaced decay if the vertex is within $\Delta R = 0.4$ of the simulated decay position. The MS vertex efficiency is parameterized as a function of the LLP decay position.
"Table 31" of "Search for long-lived particles produced in $pp$ collisions at $\sqrt{s}=13$ TeV that decay into displaced hadronic jets in the ATLAS …
2018
Barrel MS vertex efficiencies (in %) for baryogenesis $\chi \rightarrow cbs$ benchmark samples ($m_{h}=125$ GeV). The vertex reconstruction efficiency is defined as the fraction of simulated LLP decays in the MS fiducial volume that match a reconstructed vertex ($\Delta R(\textrm{LLP,vertex}) = 0.4$) passing the baseline event selection and satisfying the vertex isolation criteria. A vertex is considered matched to a displaced decay if the vertex is within $\Delta R = 0.4$ of the simulated decay position. The MS vertex efficiency is parameterized as a function of the LLP decay position.