Reading “On Time and Being” to Construct the ‘Missing’ Division III of Being and Time – or “time and Being” –

This paper will articulate the conditions of thinking about the transition of Division II in Heidegger’s Being and Time in order to imagine the architecture of the missing Division III, which never appeared in the published Part I of Being and Time. The paper explores questions of temporality, historical temporality, and Heidegger’s confrontation with Hegel at the end of Being and Time while enlisting the resources of his very late lecture of 1962 – “On Time and Being” – to lay down the conditions of possibility to reconstruct the missing Division III. The paper argues that this feat has yet to be adequately accomplished given 90 years that have elapsed since the publication of Being and Time

A Validation of Causal Dynamical Triangulations

The Causal Dynamical Triangulation (CDT) approach to quantum gravity is a lattice approximation to the gravitational path integral. Developed by Ambj\o{}rn, Jurkiewicz and Loll, it has yielded some important results, notably the emergence of classical spacetime and short scale dimensional reduction. However, virtually all the results reported so far have been based on a single computer code. In this paper we present the first completely independent verification of the CDT algorithm, and report the successful reproduction of the emergence of classical spacetime and smooth reduction in the spectral dimension of the 2+1 and 3+1 dimensional spacetimes.Comment: 14 pages, 11 figures, updated reference

Guessing based on length functions

A guessing wiretapper's performance on a Shannon cipher system is analyzed for a source with memory. Close relationships between guessing functions and length functions are first established. Subsequently, asymptotically optimal encryption and attack strategies are identified and their performances analyzed for sources with memory. The performance metrics are exponents of guessing moments and probability of large deviations. The metrics are then characterized for unifilar sources. Universal asymptotically optimal encryption and attack strategies are also identified for unifilar sources. Guessing in the increasing order of Lempel-Ziv coding lengths is proposed for finite-state sources, and shown to be asymptotically optimal. Finally, competitive optimality properties of guessing in the increasing order of description lengths and Lempel-Ziv coding lengths are demonstrated.Comment: 16 pages, Submitted to IEEE Transactions on Information Theory, Special issue on Information Theoretic Security, Simplified proof of Proposition

Characterising stickiness of dairy powders : a thesis presented in partial fulfilment of the requirements for the degree of Master of Technology in Bioprocess Engineering, Massey University

The stickiness phenomenon, one of the major operational problems, in the spray drying process is strongly related to changes in the powder particle surface. During the course of drying, powder particles with intermediate moisture pass through a very cohesive and adhesive 'plastic' phase. This phase has shown to be influenced by surface composition, moisture content, particle size, manufacturing method, surrounding air humidity and temperature. During spray drying, the powder particle experiences varied temperature and humidity conditions, which were replicated under controlled dynamic conditions to some extent in a 'Bench-top-scale Fluid Bed Rig' or in a 'Particle Gun Rig'. In these two set-ups, stickiness-end-point or deposition rates at a particular temperature and humidity combination were plotted to develop 'Stickiness Curves' after testing different dairy-based powders. Further improvements in the 'Particle Gun Rig' has been identified to minimise heat loss for future experimentation. It has been demonstrated that the stickiness property is a surface phenomenon. This is governed by the composition of a particular powder, manufacturing methods and the temperature / humidity conditions surrounding the powder particles. The low fat powders (42%) followed a combined 'Fat and lactose based stickiness model'. The 'lactose based model' followed the predicted glass transition (Tg) trend of amorphous lactose, shifted by some degree (X) upwards, depending on the product composition or the amount of amorphous lactose present - to be specific. These quick and easy methods to identify a safe and non-sticky operating window to minimise product adhesion to the equipment wall would be of huge benefit to the dairy industry in process optimization, as fore knowledge of likely difficulties and specified operating conditions will help efficient and economic operation. Attempts have been made to rectify the humidity tracking system in a spray drier and relate the 'stickiness curves' with its drying parameters. Further work should be done by taking commercial trial runs at recommended or allowable operating conditions with reference to 'Stickiness Curves', in order to maximise the throughput and to minimise the drying cost without compromising the product quality. Looking into the effects of other variables like air velocity, angle of impact, different impact surface materials and particle size on powder stickiness would be of much interest to the dairy industry

Guessing under source uncertainty

This paper considers the problem of guessing the realization of a finite alphabet source when some side information is provided. The only knowledge the guesser has about the source and the correlated side information is that the joint source is one among a family. A notion of redundancy is first defined and a new divergence quantity that measures this redundancy is identified. This divergence quantity shares the Pythagorean property with the Kullback-Leibler divergence. Good guessing strategies that minimize the supremum redundancy (over the family) are then identified. The min-sup value measures the richness of the uncertainty set. The min-sup redundancies for two examples - the families of discrete memoryless sources and finite-state arbitrarily varying sources - are then determined.Comment: 27 pages, submitted to IEEE Transactions on Information Theory, March 2006, revised September 2006, contains minor modifications and restructuring based on reviewers' comment