Concentration fluctuations in atmospheric dispersion

This report summarizes work done at Brunel University under Agreement No.2066/62 from 15 July 1986 to 14 July 1989. The title of the project was Concentration Fluctuations in Atmospheric Dispersion. The report has three principal components. These are: (i) theoretical work on the electrostatic effects associated with dispersing charged tracers. (ii) extensive analysis of several datasets taken with the CDE sensor system, particularly one obtained at RAF Cardington on 10 May 1988; (iii) interpretation of the results of the analysis. The conclusions of the report include recommendations for further work to exploit the advantages that the system has over many others

A study of discontinuous Galerkin methods for thin bending problems

Various continuous/discontinuous Galerkin formulations are examined for the analysis of thin plates. These methods rely on weak imposition of continuity of the normal slope across element boundaries. We draw here upon developments in discontinuous Galerkin methods for second-order elliptic equations, for which several unconditionally stable methods are known, and present continuous/discontinuous Galerkin formulations for bending problems inspired by these methods. For each approach, benchmark simulations have been performed and compared. Also, conclusions are drawn on to the computational ef ciency of the different methods

Random Permutation Statistics and An Improved Slide-Determine Attack on KeeLoq

KeeLoq is a lightweight block cipher which is extensively used in the automotive industry. Its periodic structure, and overall simplicity makes it vulnerable to many different attacks. Only certain attacks are considered as really "practical" attacks on KeeLoq: the brute force, and several other attacks which require up to 2p16 known plaintexts and are then much faster than brute force, developed by Courtois et al., and (faster attack) by Dunkelman et al. On the other hand, due to the unusually small block size, there are yet many other attacks on KeeLoq, which require the knowledge of as much as about 2p32 known plaintexts but are much faster still. There are many scenarios in which such attacks are of practical interest, for example if a master key can be recovered, see Section 2 in [11] for a detailed discussion. The fastest of these attacks is an attack by Courtois, Bard and Wagner from that has a very low complexity of about 2p28 KeeLoq encryptions on average. In this paper we will propose an improved and refined attack which is faster both on average and in the best case. We also present an exact mathematical analysis of probabilities that arise in these attacks using the methods of modern analytic combinatorics

Two philosophies for solving non-linear equations in algebraic cryptanalysis

Algebraic Cryptanalysis [45] is concerned with solving of particular systems of multivariate non-linear equations which occur in cryptanalysis. Many different methods for solving such problems have been proposed in cryptanalytic literature: XL and XSL method, Gröbner bases, SAT solvers, as well as many other. In this paper we survey these methods and point out that the main working principle in all of them is essentially the same. One quantity grows faster than another quantity which leads to a “phase transition” and the problem becomes efficiently solvable. We illustrate this with examples from both symmetric and asymmetric cryptanalysis. In this paper we point out that there exists a second (more) general way of formulating algebraic attacks through dedicated coding techniques which involve redundancy with addition of new variables. This opens numerous new possibilities for the attackers and leads to interesting optimization problems where the existence of interesting equations may be somewhat deliberately engineered by the attacker

PALLIATION AND LIFE QUALITY IN LUNG-CANCER - HOW GOOD ARE CLINICIAN AT JUDGING TREATMENT OUTCOME

A recent trial by the MRC Lung Cancer Working Party used physician assessments to compare two palliative schedules of radiotherapy in lung cancer. A prospective study has been undertaken on a subset of these trial patients to see how physician assessments of symptomatic relief and general condition correlate with patient perception of therapeutic response. In 40 patients followed up monthly from presentation until close to death, good agreement was found between doctors and patients on change in specific physical symptoms and overall physical condition. Doctors were poor judges of life quality at presentation but appeared able to identify relative improvement or deterioration in overall quality of life. In conclusion, physician assessments may constitute valid end-points for radiotherapy trials comparing palliative schedules in lung cance

Sparse Exploratory Factor Analysis

Sparse principal component analysis is a very active research area in the last decade. It produces component loadings with many zero entries which facilitates their interpretation and helps avoid redundant variables. The classic factor analysis is another popular dimension reduction technique which shares similar interpretation problems and could greatly benefit from sparse solutions. Unfortunately, there are very few works considering sparse versions of the classic factor analysis. Our goal is to contribute further in this direction. We revisit the most popular procedures for exploratory factor analysis, maximum likelihood and least squares. Sparse factor loadings are obtained for them by, first, adopting a special reparameterization and, second, by introducing additional [Formula: see text]-norm penalties into the standard factor analysis problems. As a result, we propose sparse versions of the major factor analysis procedures. We illustrate the developed algorithms on well-known psychometric problems. Our sparse solutions are critically compared to ones obtained by other existing methods

General relativistic null-cone evolutions with a high-order scheme

We present a high-order scheme for solving the full non-linear Einstein equations on characteristic null hypersurfaces using the framework established by Bondi and Sachs. This formalism allows asymptotically flat spaces to be represented on a finite, compactified grid, and is thus ideal for far-field studies of gravitational radiation. We have designed an algorithm based on 4th-order radial integration and finite differencing, and a spectral representation of angular components. The scheme can offer significantly more accuracy with relatively low computational cost compared to previous methods as a result of the higher-order discretization. Based on a newly implemented code, we show that the new numerical scheme remains stable and is convergent at the expected order of accuracy.Comment: 24 pages, 3 figure