The Effect of Temperature on Refining

The results of this work indicate that elevated beating temperature drastically increases beating time and produces detrimental effects on the physical characteristics of the formed sheet as evaluated by wet web strength, tear and tensile. It is thus indicative of the value of cold temperature refining

What now for urban regeneration?

It is against recent experiences of virulent neoliberalism and commodification in UK urban environments that regeneration practitioners and core professionals must confront assumptions about the impact and purpose of recent renewal strategies. Over the last decade, urban landscapes have been reinvigorated through intense design and renewal and a massification of private investment, which have come to characterise a new urbanism. Urban regeneration – the broad banner under which much of this change has occurred – has been encouraged by many localities to the extent that it has been beyond reproach by political and critical analysts. This paper makes use of the current respite in urban renewal, which has been brought about by changes in financial markets, to revisit the policy principles and impacts of existing renewal projects as well as the strategic aspirations of several urban areas. It is hoped that this paper might stimulate debate about the future form of urban regeneration and consideration of the need for changes in policy design

The NOMAD system : expectation-based detection and correction of errors during understanding of syntactically and semantically ill-formed text

Most large text-understanding systems have been designed under the assumption that the input text will be in reasonably "neat" form (for example, newspaper stories and other edited texts). However, a great deal of natural language text (for example, memos, messages, rough drafts, conversation transcripts, etc.) have features that differ significantly from "neat" texts, posing special problems for readers, such as misspelled words, missing words, poor syntactic construction, unclear or ambiguous interpretation, missing crucial punctuation, etc. Our solution to these problems is to make use of expectations, based both on knowledge of surface English and on world knowledge of the situation being described. These syntactic and semantic expectations can be used to figure out unknown words from context, constrain the possible word senses of words with multiple meanings (ambiguity), fill in missing words (ellipsis), and resolve referents (anaphora). This method of using expectations to aid the understanding of "scruffy" texts has bee incorporated into a working computer program called NOMAD, which understands scruffy texts in the domain of Navy ship-to-shore messages

Generalised Mersenne Numbers Revisited

Generalised Mersenne Numbers (GMNs) were defined by Solinas in 1999 and feature in the NIST (FIPS 186-2) and SECG standards for use in elliptic curve cryptography. Their form is such that modular reduction is extremely efficient, thus making them an attractive choice for modular multiplication implementation. However, the issue of residue multiplication efficiency seems to have been overlooked. Asymptotically, using a cyclic rather than a linear convolution, residue multiplication modulo a Mersenne number is twice as fast as integer multiplication; this property does not hold for prime GMNs, unless they are of Mersenne's form. In this work we exploit an alternative generalisation of Mersenne numbers for which an analogue of the above property --- and hence the same efficiency ratio --- holds, even at bitlengths for which schoolbook multiplication is optimal, while also maintaining very efficient reduction. Moreover, our proposed primes are abundant at any bitlength, whereas GMNs are extremely rare. Our multiplication and reduction algorithms can also be easily parallelised, making our arithmetic particularly suitable for hardware implementation. Furthermore, the field representation we propose also naturally protects against side-channel attacks, including timing attacks, simple power analysis and differential power analysis, which is essential in many cryptographic scenarios, in constrast to GMNs.Comment: 32 pages. Accepted to Mathematics of Computatio

On the formal structure of logarithmic vector fields

In this article, we prove that a free divisor in a three dimensional complex manifold must be Euler homogeneous in a strong sense if the cohomology of its complement is the hypercohomology of its logarithmic differential forms. F.J. Calderon-Moreno et al. conjectured this implication in all dimensions and proved it in dimension two. We prove a theorem which describes in all dimensions a special minimal system of generators for the module of formal logarithmic vector fields. This formal structure theorem is closely related to the formal decomposition of a vector field by Kyoji Saito and is used in the proof of the above result. Another consequence of the formal structure theorem is that the truncated Lie algebras of logarithmic vector fields up to dimension three are solvable. We give an example that this may fail in higher dimensions.Comment: 13 page

On isogeny classes of Edwards curves over finite fields

We count the number of isogeny classes of Edwards curves over finite fields, answering a question recently posed by Rezaeian and Shparlinski. We also show that each isogeny class contains a {\em complete} Edwards curve, and that an Edwards curve is isogenous to an {\em original} Edwards curve over \F_q if and only if its group order is divisible by 8 if $q \equiv -1 \pmod{4}$, and 16 if $q \equiv 1 \pmod{4}$. Furthermore, we give formulae for the proportion of d \in \F_q \setminus \{0,1\} for which the Edwards curve $E_d$ is complete or original, relative to the total number of $d$ in each isogeny class.Comment: 27 page

Differential Landauer's principle

Landauer's principle states that the erasure of information must be a dissipative process. In this paper, we carefully analyze the recording and erasure of information on a physical memory. On the one hand, we show that in order to record some information, the memory has to be driven out of equilibrium. On the other hand, we derive a differential version of Landauer's principle: We link the rate at which entropy is produced at every time of the erasure process to the rate at which information is erased.Comment: 11 pages, 6 figure

Derivations of negative degree on quasihomogeneous isolated complete intersection singularities

J. Wahl conjectured that every quasihomogeneous isolated normal singularity admits a positive grading for which there are no derivations of negative weighted degree. We confirm his conjecture for quasihomogeneous isolated complete intersection singularities of either order at least 3 or embedding dimension at most 5. For each embedding dimension larger than 5 (and each dimension larger than 3), we give a counter-example to Wahl's conjecture.Comment: 11 page