Tools for analysing configuration interaction wavefunctions

The configuration interaction (CI) approach to quantum chemical calculations is a well-established means of calculating accurately the solution to the Schrodinger equation for many-electron systems. It represents the many-body electron wavefunction as a sum of spin-projected Slater determinants of orthogonal one-body spin-orbitals. The CI wavefunction becomes the exact solution of the Schrodinger equation as the length of the expansion becomes infinite, however, it is a difficult quantity to visualise and analyse for many-electron problems. We describe a method for efficiently calculating the spin-averaged one- and two-body reduced density matrices rho(psi)((r) over bar; (r) over bar' ) and Gamma(psi)((r) over bar (1), (r) over bar (2); (r) over bar'(1), (r) over bar'(2)) of an arbitrary CI wavefunction Psi. These low-dimensional functions are helpful tools for analysing many-body wavefunctions; we illustrate this for the case of the electron-electron cusp. From rho and Gamma one can calculate the matrix elements of any one- or two-body spin-free operator (O) over cap. For example, if (O) over cap is an applied electric field, this field can be included into the CI Hamiltonian and polarisation or gating effects may be studied for finite electron systems. (C) 2003 Elsevier B.V. All rights reserved.

Packet classification by multi-level cutting of the classification space: An algorithmic-architectural solution for IP packet classification in next generation networks

Traditionally, the Internet provides only a “best-effort” service, treating all packets going to the same destination equally. However, providing differentiated services for different users based on their quality requirements is increasingly becoming a demanding issue. For this, routers need to have the capability to distinguish and isolate traffic belonging to different flows. This ability to determine the flow each packet belongs to is called packet classification. Technology vendors are reluctant to support algorithmic solutions for classification due to their non-deterministic performance. Although CAMs are favoured by technology vendors due to their deterministic high lookup rates, they suffer from the problems of high power dissipation and high silicon cost. This paper provides a new algorithmic-architectural solution for packet classification that mixes CAMs with algorithms based on multi-level cutting the classification space into smaller spaces. The provided solution utilizes the geometrical distribution of rules in the classification space. It provides the deterministic performance of CAMs, support for dynamic updates, and added flexibility for system designers.

Cutting edge: Langerin+ dendritic cells in the mesenteric lymph node set the stage for skin and gut immune system cross-talk.

Topical transcutaneous immunization (TCI) presents many clinical advantages, but its underlying mechanism remains unknown. TCI induced Ag-specific IgA Ab-secreting cells expressing CCR9 and CCR10 in the small intestine in a retinoic acid-dependent manner. These intestinal IgA Abs were maintained in Peyer\'s patch-null mice but abolished in the Peyer\'s patch- and lymph node-null mice. The mesenteric lymph node (MLN) was shown to be the site of IgA isotype class switching after TCI. Unexpectedly, langerin(+)CD8alpha(-) dendritic cells emerged in the MLN after TCI; they did not migrate from the skin but rather differentiated rapidly from bone marrow precursors. Depletion of langerin(+) cells impaired intestinal IgA Ab responses after TCI. Taken together, these findings suggest that MLN is indispensable for the induction of intestinal IgA Abs following skin immunization and that cross-talk between the skin and gut immune systems might be mediated by langerin(+) dendritic cells in the MLN.

Cut down by some cowardly miscreants’: Plant maiming, or the Malicious Cutting of Plants as an Act of Protest in Eighteenth and Nineteenth Century Rural England

Since the publication of Hobsbawm and Rudé's Captain Swing our understanding of the role(s) of covert protests in Hanoverian rural England has advanced considerably. Whilst we now know much about the dramatic practices of incendiarism and animal maiming and the voices of resistance in seemingly straightforward acquisitive acts, one major gap remains. Despite the fact that almost thirty years have passed since E. P. Thompson brought to our attention that under the notorious ‘Black Act’ the malicious cutting of trees was a capital offence, no subsequent research has been published. This paper seeks to address this major lacuna by systematically analysing the practices and patterns of malicious attacks on plants (‘plant maiming’) in the context of late eighteenth- and early nineteenth-century southern England. It is shown that not only did plant maiming take many different forms, attacking every conceivable type of flora, but also that it was universally understood and practised. In some communities plant maiming was the protestors' weapon of choice. As a social practice it therefore embodied wider community beliefs regarding the defence of plebeian livelihoods and identities.

Packet classification by multi-level cutting of the classification space

Traditionally, the Internet provides only a “best-effort” service, treating all packets going to the same destination equally. However, providing differentiated services for different users based on their quality requirements is increasingly becoming a demanding issue. For this, routers need to have the capability to distinguish and isolate traffic belonging to different flows. This ability to determine the flow each packet belongs to is called packet classification. Technology vendors are reluctant to support algorithmic solutions for classification due to their nondeterministic performance. Although content addressable memories (CAMs) are favoured by technology vendors due to their deterministic high-lookup rates, they suffer from the problems of high-power consumption and high-silicon cost. This paper provides a new algorithmic-architectural solution for packet classification that mixes CAMs with algorithms based on multilevel cutting of the classification space into smaller spaces. The provided solution utilizes the geometrical distribution of rules in the classification space. It provides the deterministic performance of CAMs, support for dynamic updates, and added flexibility for system designers.