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

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

Integer polyhedra for program analysis

Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from imprecision when it is necessary to take into account the integrality of the represented space. Imprecision also arises when non-linear constraints occur. Moreover, in terms of tractability, even a space defined by linear constraints can become unmanageable owing to the excessive number of inequalities. Thus it is useful to identify those inequalities whose omission has least impact on the represented space. This paper shows how these issues can be addressed in a novel way by growing the integer hull of the space and approximating the number of integral points within a bounded polyhedron

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

Kappa-symmetric SL(2,R) covariant D-brane actions

A superspace formulation of IIB supergravity which includes the field strengths of the duals of the usual physical one, three and five-form field strengths as well as the eleven-form field strength is given. The superembedding formalism is used to construct kappa-symmetric SL(2,R) covariant D-brane actions in an arbitrary supergravity background.Comment: 20 pages. Minor clarification in text. References adde

Mapping Observations of DNC and HN^13C in Dark Cloud Cores

We present results of mapping observations of the DNC, HN^13C, and H^13CO^+ lines (J=1-0) toward 4 nearby dark cloud cores, TMC-1, L1512, L1544, and L63, along with observations of the DNC and HN^13C lines (J=2-1) toward selected positions. By use of statistical equilibrium calculations based on the LVG model, the H_2 densities are derived to be (1.4-5.5)*10^5 cm^-3, and the [DNC]/[HN^13C] ratios are derived to be 1.25-5.44 with a typical uncertainty by a factor of 2. The observed [DNC]/[HNC] ratios range from 0.02 to 0.09, assuming the [^12C]/[^13C] ratio of 60. Distributions of DNC and HN^13C are generally similar to each other, whereas the distribution of H^13CO^+ is more extended than those of DNC and HN^13C, indicating that they reside in an inner part of the cores than HCO^+. The [DNC]/[HN^13C] ratio is rather constant within each core, although a small systematic gradients are observed in TMC-1 and L63. Particularly, no such systematic gradient is found in L1512 and L1544, where a significant effect of depletion of molecules is reported toward the central part of the cores. This suggests that the [DNC]/[HNC] ratio would not be very sensitive to depletion factor, unlike the [DCO^+]/[HCO^+] ratio. On the other hand, the core to core variation of the [DNC]/[HNC] ratio, which range an order of magnitude, is more remarkable than the variation within each core. These results are interpreted qualitatively by a combination of three competing time-dependent processes; gas-phase deuterium fractionation, depletion of molecules onto grain surface, and dynamical evolution of a core.Comment: 22 pages, 8 EPS figures, aasLaTex 5.0, accepted to The Astrophysical Journa

Noncommutative symmetric functions and Laplace operators for classical Lie algebras

New systems of Laplace (Casimir) operators for the orthogonal and symplectic Lie algebras are constructed. The operators are expressed in terms of paths in graphs related to matrices formed by the generators of these Lie algebras with the use of some properties of the noncommutative symmetric functions associated with a matrix. The decomposition of the Sklyanin determinant into a product of quasi-determinants play the main role in the construction. Analogous decomposition for the quantum determinant provides an alternative proof of the known construction for the Lie algebra gl(N).Comment: 25 page

Low-degree multi-spectral p-mode fitting

We combine unresolved-Sun velocity and intensity observations at multiple wavelengths from the Helioseismic and Magnetic Imager and Atmospheric Imaging Array onboard the Solar Dynamics Observatory to investigate the possibility of multi-spectral mode-frequency estimation at low spherical harmonic degree. We test a simple multi-spectral algorithm using a common line width and frequency for each mode and a separate amplitude, background and asymmetry parameter, and compare the results with those from fits to the individual spectra. The preliminary results suggest that this approach may provide a more stable fit than using the observables separately

Understanding Algorithm Performance on an Oversubscribed Scheduling Application

The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet, through careful experimentation and modeling of performance in real problem instances, we can relate characteristics of the best algorithms to characteristics of the application. In particular, we find that plateaus dominate the search spaces (thus favoring algorithms that make larger changes to solutions) and that some randomization in exploration is critical to good performance (due to the lack of gradient information on the plateaus). Based on our explanations of algorithm performance, we develop a new algorithm that combines characteristics of the best performers; the new algorithms performance is better than the previous best. We show how hypothesis driven experimentation and search modeling can both explain algorithm performance and motivate the design of a new algorithm

Nutritional and cultural aspects of plant species selection for a controlled ecological life support system

The feasibility of using higher plants in a controlled ecological life support system is discussed. Aspects of this system considered important in the use of higher plants include: limited energy, space, and mass, and problems relating to cultivation and management of plants, food processing, the psychological impact of vegetarian diets, and plant propagation. A total of 115 higher plant species are compared based on 21 selection criteria