Archaeology on Egypt's edge: archaeological research in the Dakhleh Oasis, 1819-1977

This article provides the first substantial survey of early archaeological research in Egypt’s Dakhleh Oasis. In addition to providing a much-needed survey of research, this study embeds Dakhleh’s regional research history within a broader archaeological research framework. Moreover, it explores the impact of contemporaneous historical events in Egypt and Europe upon the development of archaeology in Dakhleh. This contextualised approach allows us to trace influences upon past research trends and their impacts upon current research and approaches, as well as suggest directions for future research.

Parallel pipelined histogram architectures

Proposed is a unique cell histogram architecture which will process k data items in parallel to compute 2q histogram bins per time step. An array of m/2q cells computes an m-bin histogram with a speed-up factor of k; k ⩾ 2 makes it faster than current dual-ported memory implementations. Furthermore, simple mechanisms for conflict-free storing of the histogram bins into an external memory array are discussed.

Parallel pipelined array architectures for real-time histogram computation in consumer devices

The real-time parallel computation of histograms using an array of pipelined cells is proposed and prototyped in this paper with application to consumer imaging products. The array operates in two modes: histogram computation and histogram reading. The proposed parallel computation method does not use any memory blocks. The resulting histogram bins can be stored into an external memory block in a pipelined fashion for subsequent reading or streaming of the results. The array of cells can be tuned to accommodate the required data path width in a VLSI image processing engine as present in many imaging consumer devices. Synthesis of the architectures presented in this paper in FPGA are shown to compute the real-time histogram of images streamed at over 36 megapixels at 30 frames/s by processing in parallel 1, 2 or 4 pixels per clock cycle.

Dynamics of interacting edge defects in copolymer lamellae

It is known that terraces at the air-polymer interface of lamella forming diblock copolymers do not make discontinuous jumps in height. Despite the underlying discretized structure, the height profiles are smoothly varying. The width of a transition region of a terrace edge in isolation is typically several hundreds of nanometres, resulting from a balance between surface tension, chain stretching penalties, and the enthalpy of mixing. What is less well known in these systems is what happens when two transition regions interact with one another. In this study, we investigate the dynamics of the interactions between copolymer lamellar edges. We find that the data can be well described by a model that assumes a repulsion between adjacent edges. While the model is simplistic, and does not include molecular level details, its agreement with the data suggest that some of the the underlying assumptions provide insight into the complex interplay between defects.

Competing edge networks

We introduce a model for a pair of nonlinear evolving networks, defined over a common set of vertices, sub ject to edgewise competition. Each network may grow new edges spontaneously or through triad closure. Both networks inhibit the other’s growth and encourage the other’s demise. These nonlinear stochastic competition equations yield to a mean field analysis resulting in a nonlinear deterministic system. There may be multiple equilibria; and bifurcations of different types are shown to occur within a reduced parameter space. This situation models competitive peer-to-peer communication networks such as BlackBerry Messenger displacing SMS; or instant messaging displacing emails.

Interactions of surfactants (edge activators) and skin penetration enhancers with liposomes

Incorporating edge activators (surfactants) into liposomes was shown previously to improve estradiol vesicular skin delivery; this phenomenon was concentration dependent with low or high concentrations being less effective. Replacing surfactants with limonene produced similar behaviour, but oleic acid effects were linear with concentration up to 16% (w/w), beyond which it was incompatible with the phospholipid. This present study thus employed high sensitivity differential scanning calorimetry to probe interactions of additives with ipalmitoylphosphatidylcholine (DPPC) membranes to explain such results. Cholesterol was included as an example of a membrane stabiliser that removed the DPPC pre-transition and produced vesicles with a higher transition temperature (Tm). Surfactants also removed the lipid pre-transition but reduced Tm and co-operativity of the main peak. At higher concentrations, surfactants also formed new species, possibly mixed micelles with a lower Tm. The formation of mixed micelles may explain reduced skin delivery from liposomes containing high concentrations of surfactants. Limonene did not remove the pre-transition but reduced Tm and co-operativity of the main peak, apparently forming new species at high concentrations, again correlating with vesicular delivery of estradiol. Oleic acid obliterated the pre-transition. The Tm and the co-operativity of the main peak were reduced with oleic acid concentrations up to 33.2 mol%, above which there was no further change. At higher concentrations, phase separation was evident, confirming previous skin transport findings.

Feedback design for regularizing descriptor systems

This paper surveys numerical techniques for the regularization of descriptor (generalized state-space) systems by proportional and derivative feedback. We review generalizations of controllability and observability to descriptor systems along with definitions of regularity and index in terms of the Weierstraß canonical form. Three condensed forms display the controllability and observability properties of a descriptor system. The condensed forms are obtained through orthogonal equivalence transformations and rank decisions, so they may be computed by numerically stable algorithms. In addition, the condensed forms display whether a descriptor system is regularizable, i.e., when the system pencil can be made to be regular by derivative and/or proportional output feedback, and, if so, what index can be achieved. Also included is a a new characterization of descriptor systems that can be made to be regular with index 1 by proportional and derivative output feedback.

Duality, observability, and controllability for linear time-varying descriptor systems

A characterization of observability for linear time-varying descriptor systemsE(t)x(t)+F(t)x(t)=B(t)u(t), y(t)=C(t)x(t) was recently developed. NeitherE norC were required to have constant rank. This paper defines a dual system, and a type of controllability so that observability of the original system is equivalent to controllability of the dual system. Criteria for observability and controllability are given in terms of arrays of derivatives of the original coefficients. In addition, the duality results of this paper lead to an improvement on a previous fundamental structure result for solvable systems of the formE(t)x(t)+F(t)x(t)=f(tt).

Regularization of descriptor systems by output feedback

Conditions are given under which a descriptor, or generalized state-space system can be regularized by output feedback. It is shown that under these conditions, proportional and derivative output feedback controls can be constructed such that the closed-loop system is regular and has index at most one. This property ensures the solvability of the resulting system of dynamic-algebraic equations. A reduced form is given that allows the system properties as well as the feedback to be determined. The construction procedures used to establish the theory are based only on orthogonal matrix decompositions and can therefore be implemented in a numerically stable way.

Smoothed histogram modification for image processing

The technique of constructing a transformation, or regrading, of a discrete data set such that the histogram of the transformed data matches a given reference histogram is commonly known as histogram modification. The technique is widely used for image enhancement and normalization. A method which has been previously derived for producing such a regrading is shown to be “best” in the sense that it minimizes the error between the cumulative histogram of the transformed data and that of the given reference function, over all single-valued, monotone, discrete transformations of the data. Techniques for smoothed regrading, which provide a means of balancing the error in matching a given reference histogram against the information lost with respect to a linear transformation are also examined. The smoothed regradings are shown to optimize certain cost functionals. Numerical algorithms for generating the smoothed regradings, which are simple and efficient to implement, are described, and practical applications to the processing of LANDSAT image data are discussed.

Regularization of Descriptor Systems by Derivative and Proportional State Feedback

For linear multivariable time-invariant continuous or discrete-time singular systems it is customary to use a proportional feedback control in order to achieve a desired closed loop behaviour. Derivative feedback is rarely considered. This paper examines how derivative feedback in descriptor systems can be used to alter the structure of the system pencil under various controllability conditions. It is shown that derivative and proportional feedback controls can be constructed such that the closed loop system has a given form and is also regular and has index at most 1. This property ensures the solvability of the resulting system of dynamic-algebraic equations. The construction procedures used to establish the theory are based only on orthogonal matrix decompositions and can therefore be implemented in a numerically stable way. The problem of pole placement with derivative feedback alone and in combination with proportional state feedback is also investigated. A computational algorithm for improving the “conditioning” of the regularized closed loop system is derived.