reducing symmetries to generate easier sat instances

Finding countermodels is an effective way of disproving false conjectures. In first-order predicate logic, model finding is an undecidable problem. But if a finite model exists, it can be found by exhaustive search. The finite model generation problem in the first-order logic can also be translated to the satisfiability problem in the propositional logic. But a direct translation may not be very efficient. This paper discusses how to take the symmetries into account so as to make the resulting problem easier. A static method for adding constraints is presented, which can be thought of as an approximation of the least number heuristic (LNH). Also described is a dynamic method, which asks a model searcher like SEM to generate a set of partial models, and then gives each partial model to a propositional prover. The two methods are analyzed, and compared with each other.

constructing finite algebras with falcon

The generation of models and counterexamples is an important form of reasoning. In this paper, we give a formal account of a system, called FALCON, for constructing finite algebras from given equational axioms. The abstract algorithms, as well as some implementation details and sample applications, are presented. The generation of finite models is viewed as a constraint satisfaction problem, with ground instances of the axioms as constraints. One feature of the system is that it employs a very simple technique, called the least number heuristic, to eliminate isomorphic (partial) models, thus reducing the size of the search space. The correctness of the heuristic is proved. Some experimental data are given to show the performance and applications of the system.

Cubicity of Interval Graphs and the Claw Number

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product l(1) x l(2) x ... x l(b), where each l(i) is a closed interval of unit length on the real line. The cub/city of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b-dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line-i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number psi(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least log(2) psi(G)]. In this article, we show that for an interval graph G log(2) psi(G)-]<= cub(G)<=log(2) psi(G)]+2. It is not clear whether the upper bound of log(2) psi(G)]+2 is tight: till now we are unable to find any interval graph with cub(G)> (log(2)psi(G)]. We also show that for an interval graph G, cub(G) <= log(2) alpha], where alpha is the independence number of G. Therefore, in the special case of psi(G)=alpha, cub(G) is exactly log(2) alpha(2)]. The concept of cubicity can be generalized by considering boxes instead of cubes. A b-dimensional box is a Cartesian product l(1) x l(2) x ... x l(b), where each I is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k-dimensional boxes. It is clear that box(G)<= cub(G). From the above result, it follows that for any graph G, cub(G) <= box(G)log(2) alpha]. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323-333, 2010

Indicators for the total number of melanocytic naevi : an adjunct for screening campaigns. Observational study on 292 patients.

BACKGROUND: The presence of multiple melanocytic naevi is a strong risk factor for melanoma. Use of the whole body naevus count to identify at-risk patients is impractical. OBJECTIVES: To (i) identify a valid anatomical predictor of total naevus count; (ii) determine the number of naevi that most accurately predict total naevus count above 25, 50 and 100; and (iii) evaluate determinants of multiple melanocytic naevi and atypical naevi. METHODS: Clinical data from 292 consecutive Spanish patients consulting for skin lesions requiring debriding were collected throughout 2009 and 2010. Correlations between site-specific and whole body naevus counts were analysed. Cut-offs to predict total naevus counts were determined using the area under the receiver operating characteristic curve. RESULTS: The studied population was young (median age 31 years, interquartile range 28-43). The naevus count on the right arm correlated best with the total nevus count (R(2) 0·80 for men, 0·86 for women). Presence of at least five naevi on the right arm was the strongest determinant of a total naevus count above 50 [odds ratio (OR) 34·4, 95% confidence interval (CI) 13·9-85·0] and of having at least one atypical naevus (OR 5·7, 95% CI 2·4-13·5). Cut-off values of 6, 8 and 11 naevi on the right arm best predicted total naevus count above 25, 50 and 100, respectively. CONCLUSIONS: Our results support the arm as a practical and reliable site to estimate the total naevus count when screening or phenotyping large populations. Threshold values for the number of naevi on the arm are proposed to help identify patients for melanoma screening.

The Minimum Number of Points Taking Part in k-Sets in Sets of Unaligned Points

En este trabajo se da un ejemplo de un conjunto de n puntos situados en posición general, en el que se alcanza el mínimo número de puntos que pueden formar parte de algún k-set para todo k con 1menor que=kmenor quen/2. Se generaliza también, a puntos en posición no general, el resultado de Erdõs et al., 1973, sobre el mínimo número de puntos que pueden formar parte de algún k-set. The study of k- sets is a very relevant topic in the research area of computational geometry. The study of the maximum and minimum number of k-sets in sets of points of the plane in general position, specifically, has been developed at great length in the literature. With respect to the maximum number of k-sets, lower bounds for this maximum have been provided by Erdõs et al., Edelsbrunner and Welzl, and later by Toth. Dey also stated an upper bound for this maximum number of k-sets. With respect to the minimum number of k-set, this has been stated by Erdos el al. and, independently, by Lovasz et al. In this paper the authors give an example of a set of n points in the plane in general position (no three collinear), in which the minimum number of points that can take part in, at least, a k-set is attained for every k with 1 ≤ k < n/2. The authors also extend Erdos’s result about the minimum number of points in general position which can take part in a k-set to a set of n points not necessarily in general position. That is why this work complements the classic works we have mentioned before.

Primary students' success on the structured number line

Number lines are part of our everyday life (e.g., thermometers, kitchen scales) and are frequently used in primary mathematics as instructional aids, in texts and for assessment purposes on mathematics tests. There are two major types of number lines; structured number lines, which are the focus of this paper, and empty number lines. Structured number lines represent mathematical information by the placement of marks on a horizontal or vertical line which has been marked into proportional segments (Figure 1). Empty number lines are blank lines which students can use for calculations (Figure 2) and are not discussed further here (see van den Heuvel-Panhuizen, 2008, on the role of empty number lines). In this article, we will focus on how students’ knowledge of the structured number line develops and how they become successful users of this mathematical tool.

Scaling for the Prandtl number of the natural convection boundary layer of an inclined flat plate under uniform surface heat flux

An improved scaling analysis and direct numerical simulations are performed for the unsteady natural convection boundary layer adjacent to a downward facing inclined plate with uniform heat flux. The development of the thermal or viscous boundary layers may be classified into three distinct stages: a start-up stage, a transitional stage and a steady stage, which can be clearly identified in the analytical as well as the numerical results. Previous scaling shows that the existing scaling laws of the boundary layer thickness, velocity and steady state time scale for the natural convection flow on a heated plate of uniform heat flux provide a very poor prediction of the Prandtl number dependency of the flow. However, those scalings perform very well with Rayleigh number and aspect ratio dependency. In this study, a modified Prandtl number scaling is developed using a triple layer integral approach for Pr > 1. It is seen that in comparison to the direct numerical simulations, the modified scaling performs considerably better than the previous scaling.

Effect of fumigation temperature on the efficacy of phosphine against strongly resistant psocids liposcelis bostrychophila (Pscodoptera: Liposcelididae)

Species of Liposcelis psocids have emerged as major pests of stored grain in Australia in recent years. Several populations have been detected with high resistance to phosphine, the major chemical treatment. Highest resistance has been detected in the cosmopolitan species Liposcelis bostrychophila. As part of a national resistance management strategy to maintain the viability of phosphine, we are developing minimum effective dosage regimes (concentration x time) required to control all life stages of resistant L. bostrychophila at a range of grain temperatures. Four concentrations of phosphine, 0.1, 0.17, 0.3 aid 1 mg/L, were evaluated for their effectiveness against strongly resistant L. bostrychophila at a series of fumigation temperatures: 20, 25, 30 and 35°C. Results were recorded as the least number of days taken to achieve population extinction. We found that, at any fixed concentration of phosphine, time to population extinction decreased as fumigation temperature increased from 20 to 30°C. For example, at 0.1 mg/L, it took more than 14 days at 20°C to completely control these insects, whereas at 30°C it took only seven days. Increase in fumigation temperature from 25OC to 30°C dramatically reduced the exposure period needed to achieve population extinction of resistant psocids. For example, a dose of 0.17 mg/L over six days at 30°C completely controlled strongly resistant L. bostrychophila populations that can survive at 1 mg/L and 25°C over the same exposure period. Findings from our study will be used to formulate recommendations for registered dosage rates and fumigation periods for use in Australia.

A new data source for fisheries resource assessment: genetic estimates of the effective number of spawners. Final Report to the Fisheries Research and Development Corporation.

The development of innovative methods of stock assessment is a priority for State and Commonwealth fisheries agencies. It is driven by the need to facilitate sustainable exploitation of naturally occurring fisheries resources for the current and future economic, social and environmental well being of Australia. This project was initiated in this context and took advantage of considerable recent achievements in genomics that are shaping our comprehension of the DNA of humans and animals. The basic idea behind this project was that genetic estimates of effective population size, which can be made from empirical measurements of genetic drift, were equivalent to estimates of the successful number of spawners that is an important parameter in process of fisheries stock assessment. The broad objectives of this study were to 1. Critically evaluate a variety of mathematical methods of calculating effective spawner numbers (Ne) by a. conducting comprehensive computer simulations, and by b. analysis of empirical data collected from the Moreton Bay population of tiger prawns (P. esculentus). 2. Lay the groundwork for the application of the technology in the northern prawn fishery (NPF). 3. Produce software for the calculation of Ne, and to make it widely available. The project pulled together a range of mathematical models for estimating current effective population size from diverse sources. Some of them had been recently implemented with the latest statistical methods (eg. Bayesian framework Berthier, Beaumont et al. 2002), while others had lower profiles (eg. Pudovkin, Zaykin et al. 1996; Rousset and Raymond 1995). Computer code and later software with a user-friendly interface (NeEstimator) was produced to implement the methods. This was used as a basis for simulation experiments to evaluate the performance of the methods with an individual-based model of a prawn population. Following the guidelines suggested by computer simulations, the tiger prawn population in Moreton Bay (south-east Queensland) was sampled for genetic analysis with eight microsatellite loci in three successive spring spawning seasons in 2001, 2002 and 2003. As predicted by the simulations, the estimates had non-infinite upper confidence limits, which is a major achievement for the application of the method to a naturally-occurring, short generation, highly fecund invertebrate species. The genetic estimate of the number of successful spawners was around 1000 individuals in two consecutive years. This contrasts with about 500,000 prawns participating in spawning. It is not possible to distinguish successful from non-successful spawners so we suggest a high level of protection for the entire spawning population. We interpret the difference in numbers between successful and non-successful spawners as a large variation in the number of offspring per family that survive – a large number of families have no surviving offspring, while a few have a large number. We explored various ways in which Ne can be useful in fisheries management. It can be a surrogate for spawning population size, assuming the ratio between Ne and spawning population size has been previously calculated for that species. Alternatively, it can be a surrogate for recruitment, again assuming that the ratio between Ne and recruitment has been previously determined. The number of species that can be analysed in this way, however, is likely to be small because of species-specific life history requirements that need to be satisfied for accuracy. The most universal approach would be to integrate Ne with spawning stock-recruitment models, so that these models are more accurate when applied to fisheries populations. A pathway to achieve this was established in this project, which we predict will significantly improve fisheries sustainability in the future. Regardless of the success of integrating Ne into spawning stock-recruitment models, Ne could be used as a fisheries monitoring tool. Declines in spawning stock size or increases in natural or harvest mortality would be reflected by a decline in Ne. This would be good for data-poor fisheries and provides fishery independent information, however, we suggest a species-by-species approach. Some species may be too numerous or experiencing too much migration for the method to work. During the project two important theoretical studies of the simultaneous estimation of effective population size and migration were published (Vitalis and Couvet 2001b; Wang and Whitlock 2003). These methods, combined with collection of preliminary genetic data from the tiger prawn population in southern Gulf of Carpentaria population and a computer simulation study that evaluated the effect of differing reproductive strategies on genetic estimates, suggest that this technology could make an important contribution to the stock assessment process in the northern prawn fishery (NPF). Advances in the genomics world are rapid and already a cheaper, more reliable substitute for microsatellite loci in this technology is available. Digital data from single nucleotide polymorphisms (SNPs) are likely to super cede ‘analogue’ microsatellite data, making it cheaper and easier to apply the method to species with large population sizes.

Invited paper Application of the least mean fourth (LMF) adaptive algorithm to signals associated with gaussian noise

This paper considers the applicability of the least mean fourth (LM F) power gradient adaptation criteria with 'advantage' for signals associated with gaussian noise, the associated noise power estimate not being known. The proposed method, as an adaptive spectral estimator, is found to provide superior performance than the least mean square (LMS) adaptation for the same (or even lower) speed of convergence for signals having sufficiently high signal-to-gaussian noise ratio. The results include comparison of the performance of the LMS-tapped delay line, LMF-tapped delay line, LMS-lattice and LMF-lattice algorithms, with the Burg's block data method as reference. The signals, like sinusoids with noise and stochastic signals like EEG, are considered in this study.

Pre- and post-copulatory sexual selection in the least killifish, Heterandria formosa

It has been only recently realized that sexual selection does not end at copulation but that post-copulatory processes are often important in determining the fitness of individuals. In this thesis, I experimentally studied both pre- and post-copulatory sexual selection in the least killifish, Heterandria formosa. I found that this species suffers from severe inbreeding depression in male reproductive behaviour, offspring viability and offspring maturation times. Neither sex showed pre-copulatory inbreeding avoidance but when females mated with their brothers, less sperm were retrieved from their reproductive system compared to the situation when females mated with unrelated males. Whether the difference in sperm numbers is due to female or male effect could not be resolved. Based on theory, females should be more eager to avoid inbreeding than males in this species, because females invest more in their offspring than males do. Inbreeding seems to be an important part of this species biology and the severe inbreeding depression has most likely selected for the evolution of the post-copulatory inbreeding avoidance mechanism that I found. In addition, I studied the effects of polyandry on female reproductive success. When females mated with more than one male, they were more likely to get pregnant. However, I also found a cost of polyandry. The offspring of females mated to four males took longer to reach sexual maturity compared to the offspring of monandrous females. This cost may be explained by parent-offspring conflict over maternal resource allocation. In another experiment, in which within-brood relatedness was manipulated, offspring sizes decreased over time when within-brood relatedness was low. This result is partly in accordance with the kinship theory of genomic imprinting. When relatedness decreases, offspring are expected to be less co-operative and demand fewer resources from their mother, which leads to impaired development. In the last chapter of my thesis, I show that H. formosa males do not prefer large females as in other Poeciliidae species. I suggest that males view smaller females as more profitable mates because those are more likely virgin. In conclusion, I found both pre- and post-copulatory sexual selection to be important factors in determining reproductive success in H. formosa.

A note on the Hadwiger number of circular arc graphs

The intention of this note is to motivate the researchers to study Hadwiger's conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G, and let χ(G) denote its chromatic number. Hadwiger's conjecture states that η(G)greater-or-equal, slantedχ(G) and is one of the most important and difficult open problems in graph theory. From the point of view of researchers who are sceptical of the validity of the conjecture, it is interesting to study the conjecture for graph classes where η(G) is guaranteed not to grow too fast with respect to χ(G), since such classes of graphs are indeed a reasonable place to look for possible counterexamples. We show that in any circular arc graph G, η(G)less-than-or-equals, slant2χ(G)−1, and there is a family with equality. So, it makes sense to study Hadwiger's conjecture for this family.