Computational Investigation of Inlet Distortion at High Angles of Attack

Lip separation is one of the primary sources of inlet distortion, which can result in a loss in fan stability. High angles of incidence are one of several critical causes of lip separation. There have been many studies into inlet performance at high incidence, including the resulting distortion levels when lip separation occurs. However, the vast majority of these investigations have been carried out experimentally, with little in the way of computational results for inlet performance at high incidence. The flow topology within an inlet when lip separation has occurred is also not well understood. This work aims to demonstrate a suitable model for the prediction of inlet flows at high incidence using ANSYS CFX, looking at both the performance of the inlet and the separated flow topology within the inlet. The attenuating effect of the fan is also investigated, with particular emphasis on the flow redistribution ahead of the fan. The results show that the model used is suitable for predicting inlet performance in adverse operating conditions, showing good agreement with experimental results. In addition, the attenuation of the distortion by the fan is also captured by the numerical model.

Cube, cylinder, core and pull-off strength relationships

This limited experimental investigation examined the relationships between the compressive strengths of cubes, cylinders, cores and the estimated compressive strengths derived from pull-off tests for a relatively low-strength structural-grade concrete (<35 N/mm2). Test specimens were cast and tested at 7, 14, 28, 56 and 84 days. The relationships of the trends of the test results to the trends of results of standard cube specimens and standard cylinder specimens were compared. It was found that the mean strength of each type of specimen tended to increase as a function of the natural logarithm of the specimen age. The mean strength of cylinders of length/diameter ratio 2.0 was found to be slightly greater (by about 7.5%) than the generally accepted value of 80% of the mean cube strength. Core results were corrected using correction factors defined in BS 6089 and the UK national annex to BS EN 12504-1. The mean corrected cube strength of cores taken from cubes was approximately 12% greater than the mean companion cube strength. The mean corrected cylinder strength of cores taken from cubes was approximately 5% greater than the mean companion cylinder strength. The potential cube and cylinder strengths of cores taken from slabs cured under different environmental conditions correlated well with companion cube and cylinder strengths respectively at 28 days. The pull-off test results gave a variable but, on average, slightly conservative estimate of the cube compressive strength of the relatively low-strength structural-grade concrete, using a simple general linear estimated compressive cube strength to tensile strength correlation factor of 10.

Impact of Metric Selection on Wireless DeAuthentication DoS Attack Performance

DeAuthentication Denial of Service attacks in Public Access WiFi operate by exploiting the lack of authentication of management frames in the 802.11 protocol. Detection of these attacks rely almost exclusively on the selection of appropriate thresholds. In this work the authors demonstrate that there are additional, previously unconsidered, metrics which also influence DoS detection performance. A method of systematically tuning these metrics to optimal values is proposed which ensures that parameter choices are repeatable and verifiable.

The Forgiving Graph: a distributed data structure for low stretch under adversarial attack

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick “repairs,” which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions, without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been l in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most l log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degree would have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network.