Continuity for self-destructive percolation in the plane

A few years ago two of us introduced, motivated by the study of certain forest-fireprocesses, the self-destructive percolation model (abbreviated as sdp model). A typical configuration for the sdp model with parameters p and delta is generated in three steps: First we generate a typical configuration for the ordinary percolation model with parameter p. Next, we make all sites in the infinite occupied cluster vacant. Finally, each site that was already vacant in the beginning or made vacant by the above action, becomes occupied with probability delta (independent of the other sites). Let theta(p, delta) be the probability that some specified vertex belongs, in the final configuration, to an infinite occupied cluster. In our earlier paper we stated the conjecture that, for the square lattice and other planar lattices, the function theta has a discontinuity at points of the form (p_c, delta), with delta sufficiently small. We also showed remarkable consequences for the forest-fire models. The conjecture naturally raises the question whether the function theta is continuous outside some region of the above mentioned form. We prove that this is indeed the case. An important ingredient in our proof is a (somewhat stronger form of a) recent ingenious RSW-like percolation result of Bollob\'{a}s and Riordan

The Failure of Local and Federal Prosecutors to Curb Police Brutality

Although police departments across the country have attempted to ameliorate the hostility between police officers and the cumminity, through careful screening of applicants, minority recruitment, and community policing, police brutality remains a problem within our urban cities. This Essay will first argue that police brutality is largely ignored. Second, it will examine the obstacles facing local and federal prosecutors in obtaining convictions. Then it will compare the advantages and disadvantages of delegating primary responsibility for these cases to the state versus the federal level. Finally, it will argue that, although there are obstacles and advantages for both local and federal prosecutors, ultimately justice is best seved when police brutality is primarily pursued by local prosecutors

AOSD Ontology 1.0 - Public Ontology of Aspect-Orientation

This report presents a Common Foundation for Aspect-Oriented Software Development. A Common Foundation is required to enable effective communication and to enable integration of activities within the Network of Excellence. This Common Foundation is realized by developing an ontology, i.e. the shared meaning of terms and concepts in the domain of AOSD. In the first part of this report, we describe the definitions of an initial set of common AOSD terms. There is general agreement on these definitions. In the second part, we describe the Common Foundation task in detail

Morse theory on spaces of braids and Lagrangian dynamics

In the first half of the paper we construct a Morse-type theory on certain spaces of braid diagrams. We define a topological invariant of closed positive braids which is correlated with the existence of invariant sets of parabolic flows defined on discretized braid spaces. Parabolic flows, a type of one-dimensional lattice dynamics, evolve singular braid diagrams in such a way as to decrease their topological complexity; algebraic lengths decrease monotonically. This topological invariant is derived from a Morse-Conley homotopy index and provides a gloablization of `lap number' techniques used in scalar parabolic PDEs. In the second half of the paper we apply this technology to second order Lagrangians via a discrete formulation of the variational problem. This culminates in a very general forcing theorem for the existence of infinitely many braid classes of closed orbits.Comment: Revised version: numerous changes in exposition. Slight modification of two proofs and one definition; 55 pages, 20 figure

Evaluating load balancing policies for performance and energy-efficiency

Nowadays, more and more increasingly hard computations are performed in challenging fields like weather forecasting, oil and gas exploration, and cryptanalysis. Many of such computations can be implemented using a computer cluster with a large number of servers. Incoming computation requests are then, via a so-called load balancing policy, distributed over the servers to ensure optimal performance. Additionally, being able to switch-off some servers during low period of workload, gives potential to reduced energy consumption. Therefore, load balancing forms, albeit indirectly, a trade-off between performance and energy consumption. In this paper, we introduce a syntax for load-balancing policies to dynamically select a server for each request based on relevant criteria, including the number of jobs queued in servers, power states of servers, and transition delays between power states of servers. To evaluate many policies, we implement two load balancers in: (i) iDSL, a language and tool-chain for evaluating service-oriented systems, and (ii) a simulation framework in AnyLogic. Both implementations are successfully validated by comparison of the results.Comment: In Proceedings QAPL'16, arXiv:1610.0769

Analysis of packet scheduling for UMTS EUL - design decisions and performance evaluation

The UMTS Enhanced Uplink (EUL) provides higher capacity, increased data rates and smaller latency on the communication link from users towards the network. In this paper we present a performance comparison of three distinct EUL scheduling schemes (one-by-one, partial parallel and full parallel) taking into account both the packet level characteristics and the flow level dynamics due to the (random) user behaviour.\ud Using a very efficient hybrid analytical and simulation approach we analyse the three schemes with respect to performance measures such as mean file transfer time and fairness. In UMTS, a significant part of the system capacity will be used to support non-elastic voice traffic. Hence, part of our investigation is dedicated to the effects that the volume of voice traffic has on the performance of the elastic traffic supported by the EUL. Finally, we evaluate the impact that implementation specifics of a full parallel scheduler has on these measures.\ud \ud Our main conclusion is that our partial parallel scheduler, which is a hybrid between the one-by-one and full parallel, outperforms the other two schedulers in terms of mean flow transfer time, and is less sensitive to volume and nature of voice traffic. However, under certain circumstances, the partial parallel scheduler exhibits a somewhat lower fairness than the alternatives

Impact of inter-cell interference on flow level performance of scheduling schemes for the UMTS EUL

The UMTS Enhanced Uplink (EUL) is expected to provide higher capacity, increased data rates, and smaller latency on the communication link from users towards the network. A key mechanism in EUL traffic handling is the packet scheduler, for which a number of basic schemes can be identified (one-by- one, partial parallel, and full parallel). In this paper we analyze the interaction between the EUL scheduling scheme deployed in the network and the inter-cell interference. On the one hand, different scheduling schemes cause different inter-cell interference patterns on neighbouring cells. On the other hand, the different schemes are affected by inter-cell interference in different ways. The scheduling schemes are evaluated and compared under different approaches for reserving part of the allowed noise rise at the base station for inter-cell interference. For our analysis, we have developed a hybrid analytical/simulation approach allowing for fast evaluation of performance measures such as the mean flow transfer time and fairness expressing how the performance depends on the user’s location. This approach takes into account both the packet-level characteristics and the flow-level dynamics due to the random user behaviour