Specialising finite domain programs with polyhedra

A procedure is described for tightening domain constraints of finite domain logic programs by applying a static analysis based on convex polyhedra. Individual finite domain constraints are over-approximated by polyhedra to describe the solution space over ninteger variables as an n dimensional polyhedron. This polyhedron is then approximated, using projection, as an n dimensional bounding box that can be used to specialise and improve the domain constraints. The analysis can be implemented straightforwardly and an empirical evaluation of the specialisation technique is given

Method of making impurity-type semiconductor electrical contacts Patent

Fabrication of sintered impurity semiconductor brushes for electrical energy transfe

Blunting the Spike: the CV Minimum Period

The standard picture of CV secular evolution predicts a spike in the CV distribution near the observed short-period cutoff P_0 ~ 78 min, which is not observed. We show that an intrinsic spread in minimum (`bounce') periods P_b resulting from a genuine difference in some parameter controlling the evolution can remove the spike without smearing the sharpness of the cutoff. The most probable second parameter is different admixtures of magnetic stellar wind braking (at up to 5 times the GR rate) in a small tail of systems, perhaps implying that the donor magnetic field strength at formation is a second parameter specifying CV evolution. We suggest that magnetic braking resumes below the gap with a wide range, being well below the GR rate in most CVs, but significantly above it in a small tail.Comment: 5 pages, 4 figures; accepted for publication in MNRA

Improved molybdenum disulfide-silver motor brushes have extended life

Motor brushes of proper quantities of molybdenum disulfide and copper or silver are manufactured by sintering techniques. Graphite molds are used. These brushes operate satisfactorily for long periods in normal atmosphere or in a high-vacuum environment

Incremental closure for systems of two variables per inequality

Subclasses of linear inequalities where each inequality has at most two vari- ables are popular in abstract interpretation and model checking, because they strike a balance between what can be described and what can be efficiently computed. This paper focuses on the TVPI class of inequalities, for which each coefficient of each two variable inequality is unrestricted. An implied TVPI in- equality can be generated from a pair of TVPI inequalities by eliminating a given common variable (echoing resolution on clauses). This operation, called result , can be applied to derive TVPI inequalities which are entailed (implied) by a given TVPI system. The key operation on TVPI is calculating closure: satisfiability can be observed from a closed system and a closed system also simplifies the calculation of other operations. A closed system can be derived by repeatedly applying the result operator. The process of adding a single TVPI inequality to an already closed input TVPI system and then finding the closure of this augmented system is called incremental closure. This too can be calcu- lated by the repeated application of the result operator. This paper studies the calculus defined by result , the structure of result derivations, and how deriva- tions can be combined and controlled. A series of lemmata on derivations are presented that, collectively, provide a pathway for synthesising an algorithm for incremental closure. The complexity of the incremental closure algorithm is analysed and found to be O (( n 2 + m 2 )lg( m )), where n is the number of variables and m the number of inequalities of the input TVPI system

A Firm Upper Limit to the Radius of the Neutron Star in SAX J1808.4-3658

We show that observations of X-ray pulsing from SAX J1808.4-3658 place a firm upper limit of 13.8 m^{1/3} km on the radius of the neutron star, where m is its mass in solar units. The limit is independent of distance or assumptions about the magnetospheric geometry, and could be significantly tightened by observations of the pulsations in the near future. We discuss the implications for the equation of state and the possible neutron star mass.Comment: (7 pages, 1 figure, accepted for publication in ApJ Letters

Mathematical modelling plant signalling networks

During the last two decades, molecular genetic studies and the completion of the sequencing of the Arabidopsis thaliana genome have increased knowledge of hormonal regulation in plants. These signal transduction pathways act in concert through gene regulatory and signalling networks whose main components have begun to be elucidated. Our understanding of the resulting cellular processes is hindered by the complex, and sometimes counter-intuitive, dynamics of the networks, which may be interconnected through feedback controls and cross-regulation. Mathematical modelling provides a valuable tool to investigate such dynamics and to perform in silico experiments that may not be easily carried out in a laboratory. In this article, we firstly review general methods for modelling gene and signalling networks and their application in plants. We then describe specific models of hormonal perception and cross-talk in plants. This sub-cellular analysis paves the way for more comprehensive mathematical studies of hormonal transport and signalling in a multi-scale setting

Magnetometeorology: Relationships between the weather and earth's magnetic field

A comparison of meteorological pressures and the strength of earth's magnetic field shows that the magnetic field exerts a controlling influence on the average pressure in the troposphere at high latitudes. The possibility of long-term changes in the goemagnetic field affecting the climate is discussed

Quadtrees as an Abstract Domain

Quadtrees have proved popular in computer graphics and spatial databases as a way of representing regions in two dimensional space. This hierarchical data-structure is flexible enough to support non-convex and even disconnected regions, therefore it is natural to ask whether this datastructure can form the basis of an abstract domain. This paper explores this question and suggests that quadtrees offer a new approach to weakly relational domains whilst their hierarchical structure naturally lends itself to representation with boolean functions