Theory manual to OctVCE – a cartesian cell CFD code with special application to blast wave problems, Department of Mechanical Engineering Report 2007/12

OctVCE is a cartesian cell CFD code produced especially for numerical simulations of shock and blast wave interactions with complex geometries, in particular, from explosions. Virtual Cell Embedding (VCE) was chosen as its cartesian cell kernel for its simplicity and sufficiency for practical engineering design problems. The code uses a finite-volume formulation of the unsteady Euler equations with a second order explicit Runge-Kutta Godonov (MUSCL) scheme. Gradients are calculated using a least-squares method with a minmod limiter. Flux solvers used are AUSM, AUSMDV and EFM. No fluid-structure coupling or chemical reactions are allowed, but gas models can be perfect gas and JWL or JWLB for the explosive products. This report also describes the code’s ‘octree’ mesh adaptive capability and point-inclusion query procedures for the VCE geometry engine. Finally, some space will also be devoted to describing code parallelization using the shared-memory OpenMP paradigm. The user manual to the code is to be found in the companion report 2007/13.

User guide for shock and blast simulation with the OctVCE code (version 3.5+), Department of Mechanical Engineering Report 2007/13

OctVCE is a cartesian cell CFD code produced especially for numerical simulations of shock and blast wave interactions with complex geometries. Virtual Cell Embedding (VCE) was chosen as its cartesian cell kernel as it is simple to code and sufficient for practical engineering design problems. This also makes the code much more ‘user-friendly’ than structured grid approaches as the gridding process is done automatically. The CFD methodology relies on a finite-volume formulation of the unsteady Euler equations and is solved using a standard explicit Godonov (MUSCL) scheme. Both octree-based adaptive mesh refinement and shared-memory parallel processing capability have also been incorporated. For further details on the theory behind the code, see the companion report 2007/12.

Serious criminal offending and mental disorder - Case linkage study

Background A relationship exists between mental disorder and offending behaviours but the nature and extent of the association remains in doubt. Method Those convicted in the higher courts of Victoria between 1993 and 1995 had their pyschiatric history explored by case linkage to a register listing virtually all contacts with the public psychiatric services. Results Prior psychiatric contact was found in 25% or offenders, but the personality disorder and substance misuse accounted for much of this relationship. Schizophrenia and affective disorders were also over-represented, particularly those with coexisting substance misuse. Conclusions The increased offending in schizophrenia and affective illness is modest and may often be mediated by coexisting substance misuse. The risk of a serious crime being committed by someone with a major mental illness is small and does not justify subjecting them, as a group, to either increased institutional containment or greater coercion.

Community care and criminal offending in schizophrenia

Background The introduction of community care in psychiatry is widely thought to have resulted in more offending among the seriously mentally ill. This view affects public policy towards and public perceptions of such people. We investigated the association between the introduction of community care and the pattern of offending in patients with schizophrenia in Victoria, Australia. Methods We established patterns of offending from criminal records in two groups of patients with schizophrenia over their lifetime to date and in the 10 years after their first hospital admission. One group was first admitted in 1975 before major deinstitutionalisation in Victoria, the second group in 1985 when community care was becoming the norm. Each patient was matched to a control, by age, sex, and place of residence to allow for changing patterns of offending over time in the wider community. Findings Compared with controls, significantly more of those with schizophrenia were convicted at least once for ail categories of criminal offending except sexual offences (relative risk of offending in 1975=3.5 [95% CI 2.0-5.5), p=0.001, in 1985=3.0 [1.9-4.9], p=0.001). Among men, more offences were committed in the 1985 group than the 1975 group, but this was matched by a similar increase in convictions among the community controls. Those with schizophrenia who had also received treatment for substance abuse accounted for a disproportionate amount of offending. Analysis of admission data for the patients and the total population of admissions with schizophrenia showed that although there had been an increase of 74 days per annum spent in the community for each of the study population as a whole, first admissions spent only 1 more day in the community in 1985 compared with 1975. Interpretation Increased rates in criminal conviction for those with schizophrenia over the last 20 years are consistent with change in the pattern of offending in the general community. Deinstitutionalisation does not adequately explain such change. Mental-health services should aim to reduce the raised rates of criminal offending associated with schizophrenia, but turning the clock back on community care is unlikely to contribute towards any positive outcome.

Code-switching in Bangladesh

A survey of hybridization in proper names and commercial signs. CODE-SWITCHING is commonly seen as more typical of the spoken language. But there are some areas of language use, including business names (e.g. restaurants), where foreign proper names, common nouns and sometimes whole phrases are imported into the written language too. These constitute a more stable variety of code-switching than the spontaneous and more unpredictable code-switching in the spoken language.

Determining when the absolute state complexity of a Hermitian code achieves its DLP bound

Let g be the genus of the Hermitian function field H/F(q)2 and let C-L(D,mQ(infinity)) be a typical Hermitian code of length n. In [Des. Codes Cryptogr., to appear], we determined the dimension/length profile (DLP) lower bound on the state complexity of C-L(D,mQ(infinity)). Here we determine when this lower bound is tight and when it is not. For m less than or equal to n-2/2 or m greater than or equal to n-2/2 + 2g, the DLP lower bounds reach Wolf's upper bound on state complexity and thus are trivially tight. We begin by showing that for about half of the remaining values of m the DLP bounds cannot be tight. In these cases, we give a lower bound on the absolute state complexity of C-L(D,mQ(infinity)), which improves the DLP lower bound. Next we give a good coordinate order for C-L(D,mQ(infinity)). With this good order, the state complexity of C-L(D,mQ(infinity)) achieves its DLP bound (whenever this is possible). This coordinate order also provides an upper bound on the absolute state complexity of C-L(D,mQ(infinity)) (for those values of m for which the DLP bounds cannot be tight). Our bounds on absolute state complexity do not meet for some of these values of m, and this leaves open the question whether our coordinate order is best possible in these cases. A straightforward application of these results is that if C-L(D,mQ(infinity)) is self-dual, then its state complexity (with respect to the lexicographic coordinate order) achieves its DLP bound of n /2 - q(2)/4, and, in particular, so does its absolute state complexity.