Political Trust as a determinant of Volatile Vote Intentions: Separating Within- from Between-persons effects

This article studies the oft-assumed destabilizing effect of political distrust on party preferences. We argue that there are two mechanisms that relate political trust to electoral volatility: (1) structurally low trust undermines the formation of stable party preferences and thereby stimulates volatility, and (2) declining trust drives voters, particularly supporters of parties in government, to change party preference. These rivaling mechanisms are often conflated. Using the within–between random effects approach on two extensive panel data sets (covering three different governmental periods in The Netherlands between 2006 and 2017) allows us to separate both mechanisms and estimate them simultaneously. We find evidence for both the structural and the dynamic effects of political trust on changing vote intentions

Spatially encoded light for Large-alphabet Quantum Key Distribution

Most Quantum Key Distribution protocols use a two-dimensional basis such as HV polarization as first proposed by Bennett and Brassard in 1984. These protocols are consequently limited to a key generation density of 1 bit per photon. We increase this key density by encoding information in the transverse spatial displacement of the used photons. Employing this higher-dimensional Hilbert space together with modern single-photon-detecting cameras, we demonstrate a proof-of-principle large-alphabet Quantum Key Distribution experiment with 1024 symbols and a shared information between sender and receiver of 7 bit per photon.Comment: 9 pages, 6 figures, Added references, Updated Fig. 1 in the main text, Updated Fig.1 in supplementary material, Added section Trojan-horse attacks in supplementary material, title changed, Added paragraphs about final key rate and overfilling the detector to result sectio

EFFECTIVE CARTOGRAPHIC METHODS FOR ASSISTING TACTICS CHOICE AND INDOOR DEPLOYMENTS DURING BUILDING FIRES – A CASESTUDY THE DUTCH FIRE BRIGADE

Information is key for a safe deployment of the fire brigade. Incorrect judgement could lead to decreased effectivity or even casualties. Because of the risks that are posed by building complexity and modern building materials, the Dutch fire brigade is increasingly hesitant to enter the building during a building fire. While no two building fires are the same and personal judgement of the fire brigade will remain necessary, good information supply could aid the commanders in making the right choices. There are a lot of factors that come into play when choosing strategy, tactics and techniques. An effective information system should present the right and up to date information at the right moment, and it should do so in an intuitive and effective manner. Most cartography research has been done for outdoor applications; indoor cartography is in its infancy. This research aims to develop cartographic methods to aid the Dutch fire brigade during building fire deployments. Based on the requirements of the organization a novel approach is introduced: ToggleMaps. This mobile interface combines a main map pane with a reference pane, both in either 2D or 3D and with either a low or a high level of detail. This allows the user to toggle between two states: a detailed 2D overview of a separate building level with its perspective within the 3D reference map, or a more detailed 3D overview of the whole building with a simplified 2D reference map of his current building level

Characterization of the fundamental properties of wireless CSMA multi-hop networks

A wireless multi-hop network consists of a group of decentralized and self-organized wireless devices that collaborate to complete their tasks in a distributed way. Data packets are forwarded collaboratively hop-by-hop from source nodes to their respective destination nodes with other nodes acting as intermediate relays. Existing and future applications in wireless multi-hop networks will greatly benefit from better understanding of the fundamental properties of such networks. In this thesis we explore two fundamental properties of distributed wireless CSMA multi-hop networks, connectivity and capacity. A network is connected if and only if there is at least one (multi-hop) path between any pair of nodes. We investigate the critical transmission power for asymptotic connectivity in large wireless CSMA multi-hop networks under the SINR model. The critical transmission power is the minimum transmission power each node needs to transmit to guarantee that the resulting network is connected aas. Both upper bound and lower bound of the critical transmission power are obtained analytically. The two bounds are tight and differ by a constant factor only. Next we shift focus to the capacity property. First, we develop a distributed routing algorithm where each node makes routing decisions based on local information only. This is compatible with the distributed nature of large wireless CSMA multi-hop networks. Second, we show that by carefully choosing controllable parameters of the CSMA protocols, together with the routing algorithm, a distributed CSMA network can achieve the order-optimal throughput scaling law. Scaling laws are only up to order and most network design choices have a significant effect on the constants preceding the order while not affecting the scaling law. Therefore we further to analyze the pre-constant by giving an upper and a lower bound of throughput. The tightness of the bounds is validated using simulations

Short-Term Hyperglycemic Dysregulation in Patients With Type 1 Diabetes Does Not Change Myocardial Triglyceride Content or Myocardial Function

OBJECTIVE—To evaluate the effects of hyperglycemia due to partial insulin deprivation on myocardial triglyceride (TG) content and myocardial function in patients with type 1 diabetes