Zebras, intransigence & semantic apocalypse: problems for dispositional metasemantics

Complete information dispositional metasemantics says that our expressions get their meaning in virtue of what our dispositions to apply those terms would be given complete information. The view has recently been advanced and argued to have a number of attractive features. I argue that that it threatens to make the meanings of our words indeterminate and doesn't do what it was that made a dispositional view attractive in the first place.

Noether-type discrete conserved quantities arising from a finite element approximation of a variational problem

In this work, we prove a weak Noether-type Theorem for a class of variational problems that admit broken extremals. We use this result to prove discrete Noether-type conservation laws for a conforming finite element discretisation of a model elliptic problem. In addition, we study how well the finite element scheme satisfies the continuous conservation laws arising from the application of Noether’s first theorem (1918). We summarise extensive numerical tests, illustrating the conservation of the discrete Noether law using the p-Laplacian as an example and derive a geometric-based adaptive algorithm where an appropriate Noether quantity is the goal functional.

Interactions between climate change and land use change on biodiversity: attribution problems, risks, and opportunities

Global change drivers are known to interact in their effects on biodiversity, but much research to date ignores this complexity. As a consequence, there are problems in the attribution of biodiversity change to different drivers and, therefore, our ability to manage habitats and landscapes appropriately. Few studies explicitly acknowledge and account for interactive (i.e., nonadditive) effects of land use and climate change on biodiversity. One reason is that the mechanisms by which drivers interact are poorly understood. We evaluate such mechanisms, including interactions between demographic parameters, evolutionary trade-offs and synergies and threshold effects of population size and patch occupancy on population persistence. Other reasons for the lack of appropriate research are limited data availability and analytical issues in addressing interaction effects. We highlight the influence that attribution errors can have on biodiversity projections and discuss experimental designs and analytical tools suited to this challenge. Finally, we summarize the risks and opportunities provided by the existence of interaction effects. Risks include ineffective conservation management; but opportunities also arise, whereby the negative impacts of climate change on biodiversity can be reduced through appropriate land management as an adaptation measure. We hope that increasing the understanding of key mechanisms underlying interaction effects and discussing appropriate experimental and analytical designs for attribution will help researchers, policy makers, and conservation practitioners to better minimize risks and exploit opportunities provided by land use-climate change interactions.

Transcendental Brauer groups of products of CM elliptic curves

Let L be a number field and let E/L be an elliptic curve with complex multiplication by the ring of integers O_K of an imaginary quadratic field K. We use class field theory and results of Skorobogatov and Zarhin to compute the transcendental part of the Brauer group of the abelian surface ExE. The results for the odd order torsion also apply to the Brauer group of the K3 surface Kum(ExE). We describe explicitly the elliptic curves E/Q with complex multiplication by O_K such that the Brauer group of ExE contains a transcendental element of odd order. We show that such an element gives rise to a Brauer-Manin obstruction to weak approximation on Kum(ExE), while there is no obstruction coming from the algebraic part of the Brauer group.

Computing the Cassels–Tate pairing on the 3-Selmer group of an elliptic curve

We extend the method of Cassels for computing the Cassels-Tate pairing on the 2-Selmer group of an elliptic curve, to the case of 3-Selmer groups. This requires significant modifications to both the local and global parts of the calculation. Our method is practical in sufficiently small examples, and can be used to improve the upper bound for the rank of an elliptic curve obtained by 3-descent.

Shadow lines in the arithmetic of elliptic curves

Let E/Q be an elliptic curve and p a rational prime of good ordinary reduction. For every imaginary quadratic field K/Q satisfying the Heegner hypothesis for E we have a corresponding line in E(K)\otimes Q_p, known as a shadow line. When E/Q has analytic rank 2 and E/K has analytic rank 3, shadow lines are expected to lie in E(Q)\otimes Qp. If, in addition, p splits in K/Q, then shadow lines can be determined using the anticyclotomic p-adic height pairing. We develop an algorithm to compute anticyclotomic p-adic heights which we then use to provide an algorithm to compute shadow lines. We conclude by illustrating these algorithms in a collection of examples.

Problems with accessibility to health services by persons with disabilities in Sao Paulo, Brazil

Purpose. To describe the occurrence of self-reported problems of accessibility to health services used by persons with disabilities in terms of social and health services variables. Methods. We performed a cross-sectional household survey designed to assess problems with accessibility to health services faced by persons with disabilities. We interviewed 333 persons in Sao Paulo city, in 2007. Variables related to the presence of accessibility problems, disabilities, gender, age, family head income, ethnicity, use of health services and others were analysed using frequencies, percentages, chi(2)-test, ANOVA and Poisson regression models. Results. 15.92% of the interviewed persons reported problems with accessibility to health services. Persons having multiple (prevalence ratios; PR = 2.91) or mobility disability (PR = 6.46) had more problems with accessibility than persons with hearing disability. Persons younger than 78 years old had more problems with accessibility; those who needed help to go to the health service (PR = 3.01) also. Conclusions. Persons with multiple or mobility disability, younger than 78 years, and those who needed help of others to go to the health service were more likely to have problems with accessibility to health services. This information could be one of the first steps to the management and/or planning of appropriate health services for persons with disabilities.

A review on the combination of binary classifiers in multiclass problems

Several real problems involve the classification of data into categories or classes. Given a data set containing data whose classes are known, Machine Learning algorithms can be employed for the induction of a classifier able to predict the class of new data from the same domain, performing the desired discrimination. Some learning techniques are originally conceived for the solution of problems with only two classes, also named binary classification problems. However, many problems require the discrimination of examples into more than two categories or classes. This paper presents a survey on the main strategies for the generalization of binary classifiers to problems with more than two classes, known as multiclass classification problems. The focus is on strategies that decompose the original multiclass problem into multiple binary subtasks, whose outputs are combined to obtain the final prediction.

Evolutionary tuning of SVM parameter values in multiclass problems

Support vector machines (SVMs) were originally formulated for the solution of binary classification problems. In multiclass problems, a decomposition approach is often employed, in which the multiclass problem is divided into multiple binary subproblems, whose results are combined. Generally, the performance of SVM classifiers is affected by the selection of values for their parameters. This paper investigates the use of genetic algorithms (GAs) to tune the parameters of the binary SVMs in common multiclass decompositions. The developed GA may search for a set of parameter values common to all binary classifiers or for differentiated values for each binary classifier. (C) 2008 Elsevier B.V. All rights reserved.

HIERARCHICAL DECOMPOSITION OF MULTICLASS PROBLEMS

Several popular Machine Learning techniques are originally designed for the solution of two-class problems. However, several classification problems have more than two classes. One approach to deal with multiclass problems using binary classifiers is to decompose the multiclass problem into multiple binary sub-problems disposed in a binary tree. This approach requires a binary partition of the classes for each node of the tree, which defines the tree structure. This paper presents two algorithms to determine the tree structure taking into account information collected from the used dataset. This approach allows the tree structure to be determined automatically for any multiclass dataset.

MULTIPLICITY OF POSITIVE SOLUTIONS FOR A CLASS OF NONLINEAR SCHRODINGER EQUATIONS

This paper proves the multiplicity of positive solutions for the following class of quasilinear problems: {-epsilon(p)Delta(p)u+(lambda A(x) + 1)vertical bar u vertical bar(p-2)u = f(u), R(N) u(x)>0 in R(N), where Delta(p) is the p-Laplacian operator, N > p >= 2, lambda and epsilon are positive parameters, A is a nonnegative continuous function and f is a continuous function with subcritical growth. Here, we use variational methods to get multiplicity of positive solutions involving the Lusternick-Schnirelman category of intA(-1)(0) for all sufficiently large lambda and small epsilon.