New results on systems with second-class constraints

We show how, for large classes of systems with purely second-class constraints, further information can be obtained about the constraint algebra. In particular, a subset consisting of half the full set of constraints is shown to have vanishing mutual brackets. Some other constraint brackets are also shown to be zero. The class of systems for which our results hold includes examples from non-relativistic particle mechanics as well as relativistic field theory. The results are derived at the classical level for Poisson brackets, but in the absence of commutator anomalies the same results will hold for the commutators of the constraint operators in the corresponding quantised theories.

A Polymatroid Approach to Separable Convex Optimization with Linear Ascending Constraints

We revisit a problem studied by Padakandla and Sundaresan SIAM J. Optim., August 2009] on the minimization of a separable convex function subject to linear ascending constraints. The problem arises as the core optimization in several resource allocation problems in wireless communication settings. It is also a special case of an optimization of a separable convex function over the bases of a specially structured polymatroid. We give an alternative proof of the correctness of the algorithm of Padakandla and Sundaresan. In the process we relax some of their restrictions placed on the objective function.

Morphological and functional characterisation of the burrow systems of six earthworm species (Lumbricidae)

Earthworm burrow systems are generally described based on postulated behaviours associated with the three ecological types. In this study, we used X-ray tomography to obtain 3D information on the burrowing behaviour of six very common anecic (Aporrectodea nocturna and Lumbricus terrestris) and endogeic (Aporrectodea rosea, Allolobophora chlorotica, Aporrectodea caliginosa, Aporrectodea icterica) earthworm species, introduced into repacked soil cores for 6 weeks. A simple water infiltration test, the Beerkan method, was also used to assess some functional properties of these burrow systems. Endogeic worms make larger burrow systems, which are more highly branched, less continuous and of smaller diameter, than those of anecic worms. Among the anecic species, L. terrestris burrow systems are shorter (9.2 vs 21.2 m) with a higher number (14.5 vs 23.5) of less branched burrows (12.2 vs 20.2 branches m(-1)), which are also wider (7.78 vs 5.16 mm) than those of A. nocturna. In comparison, the burrow systems made by endogeic species appeared similar to each other. However, A. rosea burrows were short and narrow, whereas A. icterica had a longer burrow system (15.7 m), more intense bioturbation intensity (refilled macropores or soil lateral compaction around them) and thus a greater number of burrows. Regarding water infiltration, anecic burrow systems were far more efficient due to open burrows linking the top and bottom of the cores. For endogeic species, we observed a linear relationship between burrow length and the water infiltration rate (R (2) = 0.49, p < 0.01). Overall, the three main characteristics significantly influencing water infiltration were burrow length, burrow number and bioturbation volume. This last characteristic highlighted the effect of burrow refilling by casts.

New variational principles for systems of partial differential equations

The question of finding variational principles for coupled systems of first order partial differential equations is considered. Using a potential representation for solutions of the first order system a higher order system is obtained. Existence of a variational principle follows if the original system can be transformed to a self-adjoint higher order system. Existence of variational principles for all linear wave equations with constant coefficients having real dispersion relations is established. The method of adjoining some of the equations of the original system to a suitable Lagrangian function by the method of Lagrange multipliers is used to construct new variational principles for a class of linear systems. The equations used as side conditions must satisfy highly-restrictive integrability conditions. In the more difficult nonlinear case the system of two equations in two independent variables can be analyzed completely. For systems determined by two conservation laws the side condition must be a conservation law in addition to satisfying the integrability conditions.

Qualitative Modelling of Linear Networks in ECAD Applications

Lee M.H., Qualitative Modelling of Linear Networks in ECAD Applications, Expert Update, Vol. 3, Num. 2, pp23-32, BCS SGES, Summer 2000. Qualitative modeling of linear networks in ecad applications (1999) by M Lee Venue: Pages 146?152 of: Proceedings 13th international workshop on qualitative reasoning, QR ?99

Boundary conditions in the simplest model of linear and second harmonic magneto-optical effects

This paper is concerned with linear and nonlinear magneto- optical effects in multilayered magnetic systems when treated by the simplest phenomenological model that allows their response to be represented in terms of electric polarization, The problem is addressed by formulating a set of boundary conditions at infinitely thin interfaces, taking into account the existence of surface polarizations. Essential details are given that describe how the formalism of distributions (generalized functions) allows these conditions to be derived directly from the differential form of Maxwell's equations. Using the same formalism we show the origin of alternative boundary conditions that exist in the literature. The boundary value problem for the wave equation is formulated, with an emphasis on the analysis of second harmonic magneto-optical effects in ferromagnetically ordered multilayers. An associated problem of conventions in setting up relationships between the nonlinear surface polarization and the fundamental electric field at the interfaces separating anisotropic layers through surface susceptibility tensors is discussed. A problem of self- consistency of the model is highlighted, relating to the existence of resealing procedures connecting the different conventions. The linear approximation with respect to magnetization is pursued, allowing rotational anisotropy of magneto-optical effects to be easily analyzed owing to the invariance of the corresponding polar and axial tensors under ordinary point groups. Required representations of the tensors are given for the groups infinitym, 4mm, mm2, and 3m, With regard to centrosymmetric multilayers, nonlinear volume polarization is also considered. A concise expression is given for its magnetic part, governed by an axial fifth-rank susceptibility tensor being invariant under the Curie group infinityinfinitym.

Structural changes in quasi-one-dimensional many-electron systems: From linear to zigzag and beyond

Many-electron systems confined to a quasi-one-dimensional geometry by a cylindrical distribution of positive charge have been investigated by density functional computations in the unrestricted local spin density approximation. Our investigations have been focused on the low-density regime, in which electrons are localized. The results reveal a wide variety of different charge and spin configurations, including linear and zig-zag chains, single-and double-strand helices, and twisted chains of dimers. The spin-spin coupling turns from weakly antiferromagnetic at relatively high density, to weakly ferromagnetic at the lowest densities considered in our computations. The stability of linear chains of localized charge has been investigated by analyzing the radial dependence of the self-consistent potential and by computing the dispersion relation of low-energy harmonic excitations.

CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions

We introduce a new mode of operation for CD-systems of restarting automata by providing explicit enable and disable conditions in the form of regular constraints. We show that, for each CD-system M of restarting automata and each mode m of operation considered by Messerschmidt and Otto, there exists a CD-system M' of restarting automata of the same type as M that, working in the new mode ed, accepts the language that M accepts in mode m. Further, we prove that in mode ed, a locally deterministic CD-system of restarting automata of type RR(W)(W) can be simulated by a locally deterministic CD-system of restarting automata of the more restricted type R(W)(W). This is the first time that a non-monotone type of R-automaton without auxiliary symbols is shown to be as expressive as the corresponding type of RR-automaton.

On CD-systems of stateless deterministic R-automata with window size one

We study cooperating distributed systems (CD-systems) of restarting automata that are very restricted: they are deterministic, they cannot rewrite, but only delete symbols, they restart immediately after performing a delete operation, they are stateless, and they have a read/write window of size 1 only, that is, these are stateless deterministic R(1)-automata. We study the expressive power of these systems by relating the class of languages that they accept by mode =1 computations to other well-studied language classes, showing in particular that this class only contains semi-linear languages, and that it includes all rational trace languages. In addition, we investigate the closure and non-closure properties of this class of languages and some of its algorithmic properties.

On Globally Deterministic CD-Systems of Stateless R-Automata with Window Size One

It is known that cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 accept a class of semi-linear languages that properly includes all rational trace languages. Although the component automata of such a CD-system are all deterministic, in general the CD-system itself is not, as in each of its computations, the initial component and the successor components are still chosen nondeterministically. Here we study CD-systems of stateless deterministic restarting automata with window size 1 that are themselves completely deterministic. In fact, we consider two such types of CD-systems, the strictly deterministic systems and the globally deterministic systems.

Implementing Distributed Systems Using Linear Naming

Linear graph reduction is a simple computational model in which the cost of naming things is explicitly represented. The key idea is the notion of "linearity". A name is linear if it is only used once, so with linear naming you cannot create more than one outstanding reference to an entity. As a result, linear naming is cheap to support and easy to reason about. Programs can be translated into the linear graph reduction model such that linear names in the program are implemented directly as linear names in the model. Nonlinear names are supported by constructing them out of linear names. The translation thus exposes those places where the program uses names in expensive, nonlinear ways. Two applications demonstrate the utility of using linear graph reduction: First, in the area of distributed computing, linear naming makes it easy to support cheap cross-network references and highly portable data structures, Linear naming also facilitates demand driven migration of tasks and data around the network without requiring explicit guidance from the programmer. Second, linear graph reduction reveals a new characterization of the phenomenon of state. Systems in which state appears are those which depend on certain -global- system properties. State is not a localizable phenomenon, which suggests that our usual object oriented metaphor for state is flawed.

On Degeneracy of Linear Reconstruction from Three Views: Linear Line Complex and Applications

This paper investigates the linear degeneracies of projective structure estimation from point and line features across three views. We show that the rank of the linear system of equations for recovering the trilinear tensor of three views reduces to 23 (instead of 26) in the case when the scene is a Linear Line Complex (set of lines in space intersecting at a common line) and is 21 when the scene is planar. The LLC situation is only linearly degenerate, and we show that one can obtain a unique solution when the admissibility constraints of the tensor are accounted for. The line configuration described by an LLC, rather than being some obscure case, is in fact quite typical. It includes, as a particular example, the case of a camera moving down a hallway in an office environment or down an urban street. Furthermore, an LLC situation may occur as an artifact such as in direct estimation from spatio-temporal derivatives of image brightness. Therefore, an investigation into degeneracies and their remedy is important also in practice.

A mechanistic study of the low pressure pyrolysis of linear siloxanes

Matrix isolation IR spectroscopy has been used to study the vacuum pyrolysis of 1,1,3,3-tetramethyldisiloxane (L1), 1,1,3,3,5,5-hexamethyltrisiloxane (L2) and 3H,5H-octamethyltetrasiloxane (L3) at ca. 1000 K in a flow reactor at low pressures. The hydrocarbons CH3, CH4, C2H2, C2H4, and C2H6 were observed as prominent pyrolysis products in all three systems, and amongst the weaker features are bands arising from the methylsilanes Me2SiH2 (for L1 and L2) and Me3SiH (for L3). The fundamental of SiO was also observed very weakly. By use of quantum chemical calculations combined with earlier kinetic models, mechanisms have been proposed involving the intermediacy of silanones Me2Si = O and MeSiH = O. Model calculations on the decomposition pathways of H3SiOSiH3 and H3SiOSiH2OSiH3 show that silanone elimination is favoured over silylene extrusion.

Cumulant-based deconvolution and identification: several new families of linear equations

This paper presents several new families of cumulant-based linear equations with respect to the inverse filter coefficients for deconvolution (equalisation) and identification of nonminimum phase systems. Based on noncausal autoregressive (AR) modeling of the output signals and three theorems, these equations are derived for the cases of 2nd-, 3rd and 4th-order cumulants, respectively, and can be expressed as identical or similar forms. The algorithms constructed from these equations are simpler in form, but can offer more accurate results than the existing methods. Since the inverse filter coefficients are simply the solution of a set of linear equations, their uniqueness can normally be guaranteed. Simulations are presented for the cases of skewed series, unskewed continuous series and unskewed discrete series. The results of these simulations confirm the feasibility and efficiency of the algorithms.

Arid rangeland production systems of Southern Africa

This paper analyses and describes the semi-arid rangelands of southern Africa. These rangelands are found in the grassland, savanna and thicket biomes and comprise all the remaining land which does not support commercial rainfed agriculture, in extent some 778221 km2 (66% of South Africa). Although production is primarily driven by rainfall, rangeland management systems have been developed to cope with the uncertain climate and to ameliorate the impact of inter-annual variation in production. We describe the rangeland types that occur, provide an insight into their management and examine some constraints on livestock production which the socio-economic environment presents. We describe the grazing management systems which apply under the two land tenure systems, namely freehold and leasehold tenure, and discuss how each of these systems effects livestock production, management and resource condition.