Gates, beads and Danubians. The defences and garrison of the auxiliary fort at Castell Collen: a speculative relationship

Davies, Jeffrey, 'Gates, beads and Danubians. The defences and garrison of the auxiliary fort at Castell Collen: a speculative relationship', Bayerische Vorgeschichtsblatter (2006) 71 pp.3-13 RAE2008

Performance Evaluation of Two-Shadow Speculative Concurrency Control

Speculative Concurrency Control (SCC) [Best92a] is a new concurrency control approach especially suited for real-time database applications. It relies on the use of redundancy to ensure that serializable schedules are discovered and adopted as early as possible, thus increasing the likelihood of the timely commitment of transactions with strict timing constraints. In [Best92b], SCC-nS, a generic algorithm that characterizes a family of SCC-based algorithms was described, and its correctness established by showing that it only admits serializable histories. In this paper, we evaluate the performance of the Two-Shadow SCC algorithm (SCC-2S), a member of the SCC-nS family, which is notable for its minimal use of redundancy. In particular, we show that SCC-2S (as a representative of SCC-based algorithms) provides significant performance gains over the widely used Optimistic Concurrency Control with Broadcast Commit (OCC-BC), under a variety of operating conditions and workloads.

Multi-version Speculative Concurrency Control with Delayed Commit

This paper presents an algorithm which extends the relatively new notion of speculative concurrency control by delaying the commitment of transactions, thus allowing other conflicting transactions to continue execution and commit rather than restart. This algorithm propagates uncommitted data to other outstanding transactions thus allowing more speculative schedules to be considered. The algorithm is shown always to find a serializable schedule, and to avoid cascading aborts. Like speculative concurrency control, it considers strictly more schedules than traditional concurrency control algorithms. Further work is needed to determine which of these speculative methods performs better on actual transaction loads.

Speculative Concurrency Control for Real-Time Databases

In this paper, we propose a new class of Concurrency Control Algorithms that is especially suited for real-time database applications. Our approach relies on the use of (potentially) redundant computations to ensure that serializable schedules are found and executed as early as possible, thus, increasing the chances of a timely commitment of transactions with strict timing constraints. Due to its nature, we term our concurrency control algorithms Speculative. The aforementioned description encompasses many algorithms that we call collectively Speculative Concurrency Control (SCC) algorithms. SCC algorithms combine the advantages of both Pessimistic and Optimistic Concurrency Control (PCC and OCC) algorithms, while avoiding their disadvantages. On the one hand, SCC resembles PCC in that conflicts are detected as early as possible, thus making alternative schedules available in a timely fashion in case they are needed. On the other hand, SCC resembles OCC in that it allows conflicting transactions to proceed concurrently, thus avoiding unnecessary delays that may jeopardize their timely commitment.

Exploiting the Transients of Adaptation for RoQ Attacks on Internet Resources

In this paper, we expose an unorthodox adversarial attack that exploits the transients of a system's adaptive behavior, as opposed to its limited steady-state capacity. We show that a well orchestrated attack could introduce significant inefficiencies that could potentially deprive a network element from much of its capacity, or significantly reduce its service quality, while evading detection by consuming an unsuspicious, small fraction of that element's hijacked capacity. This type of attack stands in sharp contrast to traditional brute-force, sustained high-rate DoS attacks, as well as recently proposed attacks that exploit specific protocol settings such as TCP timeouts. We exemplify what we term as Reduction of Quality (RoQ) attacks by exposing the vulnerabilities of common adaptation mechanisms. We develop control-theoretic models and associated metrics to quantify these vulnerabilities. We present numerical and simulation results, which we validate with observations from real Internet experiments. Our findings motivate the need for the development of adaptation mechanisms that are resilient to these new forms of attacks.

Value-cognizant Speculative Concurrency Control

A problem with Speculative Concurrency Control algorithms and other common concurrency control schemes using forward validation is that committing a transaction as soon as it finishes validating, may result in a value loss to the system. Haritsa showed that by making a lower priority transaction wait after it is validated, the number of transactions meeting their deadlines is increased, which may result in a higher value-added to the system. SCC-based protocols can benefit from the introduction of such delays by giving optimistic shadows with high value-added to the system more time to execute and commit instead of being aborted in favor of other validating transactions, whose value-added to the system is lower. In this paper we present and evaluate an extension to SCC algorithms that allows for commit deferments.

On the Impact of Low-Rate Attacks

Recent research have exposed new breeds of attacks that are capable of denying service or inflicting significant damage to TCP flows, without sustaining the attack traffic. Such attacks are often referred to as "low-rate" attacks and they stand in sharp contrast against traditional Denial of Service (DoS) attacks that can completely shut off TCP flows by flooding an Internet link. In this paper, we study the impact of these new breeds of attacks and the extent to which defense mechanisms are capable of mitigating the attack's impact. Through adopting a simple discrete-time model with a single TCP flow and a nonoblivious adversary, we were able to expose new variants of these low-rate attacks that could potentially have high attack potency per attack burst. Our analysis is focused towards worst-case scenarios, thus our results should be regarded as upper bounds on the impact of low-rate attacks rather than a real assessment under a specific attack scenario.

Profiling side-channel attacks on cryptographic algorithms

Traditionally, attacks on cryptographic algorithms looked for mathematical weaknesses in the underlying structure of a cipher. Side-channel attacks, however, look to extract secret key information based on the leakage from the device on which the cipher is implemented, be it smart-card, microprocessor, dedicated hardware or personal computer. Attacks based on the power consumption, electromagnetic emanations and execution time have all been practically demonstrated on a range of devices to reveal partial secret-key information from which the full key can be reconstructed. The focus of this thesis is power analysis, more specifically a class of attacks known as profiling attacks. These attacks assume a potential attacker has access to, or can control, an identical device to that which is under attack, which allows him to profile the power consumption of operations or data flow during encryption. This assumes a stronger adversary than traditional non-profiling attacks such as differential or correlation power analysis, however the ability to model a device allows templates to be used post-profiling to extract key information from many different target devices using the power consumption of very few encryptions. This allows an adversary to overcome protocols intended to prevent secret key recovery by restricting the number of available traces. In this thesis a detailed investigation of template attacks is conducted, along with how the selection of various attack parameters practically affect the efficiency of the secret key recovery, as well as examining the underlying assumption of profiling attacks in that the power consumption of one device can be used to extract secret keys from another. Trace only attacks, where the corresponding plaintext or ciphertext data is unavailable, are then investigated against both symmetric and asymmetric algorithms with the goal of key recovery from a single trace. This allows an adversary to bypass many of the currently proposed countermeasures, particularly in the asymmetric domain. An investigation into machine-learning methods for side-channel analysis as an alternative to template or stochastic methods is also conducted, with support vector machines, logistic regression and neural networks investigated from a side-channel viewpoint. Both binary and multi-class classification attack scenarios are examined in order to explore the relative strengths of each algorithm. Finally these machine-learning based alternatives are empirically compared with template attacks, with their respective merits examined with regards to attack efficiency.

Risikowahrnehmung und psychologische Reaktionen in öffentlichen Krisensituationen am Beispiel von Terrorattentaten / Risk perception and psychological reactions in public crisis situations using the example of terror attacks

The reactions to the 9/11 terror attacks were immense in the western population. In the current review, the impact of terror attacks is presented with surveys, clinical interviews, and scientific polls, which were identified in a comprehensive literature search. Results show that the fear of further terror attacks is comparatively overestimated in the population and is associated with numerous psychological consequences and reactions. The overestimation of the probability of further terror attacks is related among other reasons to its unique features and its strong representation in the media. Several independent studies proved that the number of stress symptoms and psychiatric diagnoses is associated with a high risk perception in relation to terror attacks. This was not only the case for victims of terror attacks, but also for people indirectly exposed to the terror attacks. In addition, there is evidence that the number of the stress symptoms correlate with the duration of TV consumption of new findings about terror attempts. Methodologically, there is a critical lack of more in-depth analyses to explain the development of risk perceptions and its influence on mental and physical health. Because of the international importance and cross-cultural differences, an international standardization of research is desirable. [In German] Die Reaktionen auf die Terrorattentate vom 9. September 2001 in New York waren in der westlichen Bevölkerung immens. In der vorliegenden Übersichtsarbeit werden die Auswirkungen von Terrorattentaten durch Einbeziehung bevölkerungsrepräsentativer Untersuchungen, Surveys, klinischer Interviews und Einstellungsbefragungen dargestellt, die über eine deskriptive Literaturrecherche ermittelt wurden. Als Ergebnis des Reviews zeigt sich, dass die Angst vor weiteren Terrorattentaten in der Bevölkerung vergleichsweise hoch und mit zahlreichen psychologischen Folgen und Reaktionen assoziiert ist. Die Einschätzung der Auftretenswahrscheinlichkeit eines Terrorattentats hängt unter anderem mit den besonderen Charakteristika und der hohen medialen Präsenz des Themas zusammen. Die Anzahl der Stresssymptome bis hin zu psychiatrischen Diagnosen erwies sich in mehreren unabhängigen Untersuchungen mit einer hohen Risikowahrnehmung assoziiert. Dies ließ sich nicht nur bei den Opfern von Terrorattentaten, sondern auch bei indirekt Betroffenen zeigen. Darüber hinaus gibt es mehrfache Belege dafür, dass die Anzahl der Stresssymptome mit der Dauer des TV-Konsums über Neuigkeiten zu Terrorattentaten zusammenhing. Als methodische Kritik ist an den gegenwärtigen Untersuchungsszenarien einzuwenden, dass es derzeit keine tiefer gehenden Analysen zur Entwicklung der Risikowahrnehmung und zu ihrem Einfluss auf die Gesundheit gibt. Aufgrund der internationalen Bedeutung des Themas und der interkulturellen Unterschiede im Umgang mit Krisensituationen ist eine internationale Standardisierung von Untersuchungszugängen wünschenswert.

Managing SMT Resource Usage through Speculative Instruction Window Weighting

Simultaneous multithreading processors dynamically share processor resources between multiple threads. In general, shared SMT resources may be managed explicitly, for instance, by dynamically setting queue occupation bounds for each thread as in the DCRA and Hill-Climbing policies. Alternatively, resources may be managed implicitly; that is, resource usage is controlled by placing the desired instruction mix in the resources. In this case, the main resource management tool is the instruction fetch policy which must predict the behavior of each thread (branch mispredictions, long-latency loads, etc.) as it fetches instructions.