On collective intentions: collective action in economics and philosophy

Philosophers and economists write about collective action from distinct but related points of view. This paper aims to bridge these perspectives. Economists have been concerned with rationality in a strategic context. There, problems posed by “coordination games” seem to point to a form of rational action, “team thinking,” which is not individualistic. Philosophers’ analyses of collective intention, however, sometimes reduce collective action to a set of individually instrumental actions. They do not, therefore, capture the first person plural perspective characteristic of team thinking. Other analyses, problematically, depict intentions ranging over others’ actions. I offer an analysis of collective intention which avoids these problems. A collective intention aims only at causing an individual action, but its propositional content stipulates its mirroring in other minds.

Maximum principles for vectorial approximate minimisers on non-convex functionals

We establish Maximum Principles which apply to vectorial approximate minimizers of the general integral functional of Calculus of Variations. Our main result is a version of the Convex Hull Property. The primary advance compared to results already existing in the literature is that we have dropped the quasiconvexity assumption of the integrand in the gradient term. The lack of weak Lower semicontinuity is compensated by introducing a nonlinear convergence technique, based on the approximation of the projection onto a convex set by reflections and on the invariance of the integrand in the gradient term under the Orthogonal Group. Maximum Principles are implied for the relaxed solution in the case of non-existence of minimizers and for minimizing solutions of the Euler–Lagrange system of PDE.

Application of complex extreme learning machine to multiclass classification problems with high dimensionality: a THz spectra classification problem

We extend extreme learning machine (ELM) classifiers to complex Reproducing Kernel Hilbert Spaces (RKHS) where the input/output variables as well as the optimization variables are complex-valued. A new family of classifiers, called complex-valued ELM (CELM) suitable for complex-valued multiple-input–multiple-output processing is introduced. In the proposed method, the associated Lagrangian is computed using induced RKHS kernels, adopting a Wirtinger calculus approach formulated as a constrained optimization problem similarly to the conventional ELM classifier formulation. When training the CELM, the Karush–Khun–Tuker (KKT) theorem is used to solve the dual optimization problem that consists of satisfying simultaneously smallest training error as well as smallest norm of output weights criteria. The proposed formulation also addresses aspects of quaternary classification within a Clifford algebra context. For 2D complex-valued inputs, user-defined complex-coupled hyper-planes divide the classifier input space into four partitions. For 3D complex-valued inputs, the formulation generates three pairs of complex-coupled hyper-planes through orthogonal projections. The six hyper-planes then divide the 3D space into eight partitions. It is shown that the CELM problem formulation is equivalent to solving six real-valued ELM tasks, which are induced by projecting the chosen complex kernel across the different user-defined coordinate planes. A classification example of powdered samples on the basis of their terahertz spectral signatures is used to demonstrate the advantages of the CELM classifiers compared to their SVM counterparts. The proposed classifiers retain the advantages of their ELM counterparts, in that they can perform multiclass classification with lower computational complexity than SVM classifiers. Furthermore, because of their ability to perform classification tasks fast, the proposed formulations are of interest to real-time applications.

The uniqueness of signature problem in the non-Markov setting

We establish a general framework for a class of multidimensional stochastic processes over [0,1] under which with probability one, the signature (the collection of iterated path integrals in the sense of rough paths) is well-defined and determines the sample paths of the process up to reparametrization. In particular, by using the Malliavin calculus we show that our method applies to a class of Gaussian processes including fractional Brownian motion with Hurst parameter H>1/4, the Ornstein–Uhlenbeck process and the Brownian bridge.

Optimal infinity-quasiconformal immersions

For a Hamiltonian K ∈ C2(RN × n) and a map u:Ω ⊆ Rn − → RN, we consider the supremal functional (1) The “Euler−Lagrange” PDE associated to (1)is the quasilinear system (2) Here KP is the derivative and [ KP ] ⊥ is the projection on its nullspace. (1)and (2)are the fundamental objects of vector-valued Calculus of Variations in L∞ and first arose in recent work of the author [N. Katzourakis, J. Differ. Eqs. 253 (2012) 2123–2139; Commun. Partial Differ. Eqs. 39 (2014) 2091–2124]. Herein we apply our results to Geometric Analysis by choosing as K the dilation function which measures the deviation of u from being conformal. Our main result is that appropriately defined minimisers of (1)solve (2). Hence, PDE methods can be used to study optimised quasiconformal maps. Nonconvexity of K and appearance of interfaces where [ KP ] ⊥ is discontinuous cause extra difficulties. When n = N, this approach has previously been followed by Capogna−Raich ? and relates to Teichmüller’s theory. In particular, we disprove a conjecture appearing therein.

Efficient but destructive: a test of the dental wash technique using secondary electron microscopy

The Boyadjian et al dental wash technique provides, in certain contexts, the only chance to analyze and quantify the use of plants by past populations and is therefore an important milestone for the reconstruction of paleodiet. With this paper we present recent investigations and results upon the influence of this method on teeth. A series of six teeth from a three thousand years old Brazilian shellmound (Jabuticabeira II) was examined before and after dental wash. The main focus was documenting the alteration of the surfaces and microstructures. The status of all teeth were documented using macrophotography, optical light microscopy, and atmospheric Secondary Electron Microscopy (aSEM) prior and after applying the dental wash technique. The comparison of pictures taken before and after dental wash showed the different degrees of variation and damage done to the teeth but, also, provided additional information about microstructures, which have not been visible before. Consequently we suggest that dental wash should only be carried out, if absolutely necessary, after dental pathology, dental morphology and microwear studies have been accomplished. (C) 2010 Elsevier Ltd. All rights reserved.

Large time behaviour for functional differential equations with dominant eigenvalues of arbitrary order

The spectral theory for linear autonomous neutral functional differential equations (FDE) yields explicit formulas for the large time behaviour of solutions. Our results are based on resolvent computations and Dunford calculus, applied to establish explicit formulas for the large time behaviour of solutions of FDE. We investigate in detail a class of two-dimensional systems of FDE. (C) 2009 Elsevier Inc. All rights reserved.

Spectral flow and iteration of closed semi-Riemannian geodesics

We introduce the notion of spectral flow along a periodic semi-Riemannian geodesic, as a suitable substitute of the Morse index in the Riemannian case. We study the growth of the spectral flow along a closed geodesic under iteration, determining its asymptotic behavior.

ALGEBRAIC AND GEOMETRIC THEORY OF THE TOPOLOGICAL RING OF COLOMBEAU GENERALIZED FUNCTIONS

We continue the investigation of the algebraic and topological structure of the algebra of Colombeau generalized functions with the aim of building up the algebraic basis for the theory of these functions. This was started in a previous work of Aragona and Juriaans, where the algebraic and topological structure of the Colombeau generalized numbers were studied. Here, among other important things, we determine completely the minimal primes of (K) over bar and introduce several invariants of the ideals of 9(Q). The main tools we use are the algebraic results obtained by Aragona and Juriaans and the theory of differential calculus on generalized manifolds developed by Aragona and co-workers. The main achievement of the differential calculus is that all classical objects, such as distributions, become Cl-functions. Our purpose is to build an independent and intrinsic theory for Colombeau generalized functions and place them in a wider context.

Extraction of structured programs from specification proofs

We present a method using an extended logical system for obtaining programs from specifications written in a sublanguage of CASL. These programs are “correct” in the sense that they satisfy their specifications. The technique we use is to extract programs from proofs in formal logic by techniques due to Curry and Howard. The logical calculus, however, is novel because it adds structural rules corresponding to the standard ways of modifying specifications: translating (renaming), taking unions, and hiding signatures. Although programs extracted by the Curry-Howard process can be very cumbersome, we use a number of simplifications that ensure that the programs extracted are in a language close to a standard high-level programming language. We use this to produce an executable refinement of a given specification and we then provide a method for producing a program module that maximally respects the original structure of the specification. Throughout the paper we demonstrate the technique with a simple example.

Mechanising first-order temporal resolution

First-order temporal logic is a concise and powerful notation, with many potential applications in both Computer Science and Artificial Intelligence. While the full logic is highly complex, recent work on monodic first-order temporal logics has identified important enumerable and even decidable fragments. Although a complete and correct resolution-style calculus has already been suggested for this specific fragment, this calculus involves constructions too complex to be of practical value. In this paper, we develop a machine-oriented clausal resolution method which features radically simplified proof search. We first define a normal form for monodic formulae and then introduce a novel resolution calculus that can be applied to formulae in this normal form. By careful encoding, parts of the calculus can be implemented using classical first-order resolution and can, thus, be efficiently implemented. We prove correctness and completeness results for the calculus and illustrate it on a comprehensive example. An implementation of the method is briefly discussed.

Monodic Temporal Resolution

First-order temporal logic is a coincise and powerful notation, with many potential applications in both Computer Science and Artificial Intelligence. While the full logic is highly complex, recent work on monodic first-order temporal logics have identified important enumerable and even decidable fragments. In this paper we present the first resolution-based calculus for monodic first-order temporal logic. Although the main focus of the paper is on establishing completeness result, we also consider implementation issues and define a basic loop-search algorithm that may be used to guide the temporal resolution system.

Stratified resolution

We introduce a calculus of stratified resolution, in which special attention is paid to clauses that "define" relations. If such clauses are discovered in the initial set of clauses, they are treated using the rule of definition unfolding, i.e. the rule that replaces defined relations by their definitions. Stratified resolution comes with a powerful notion of redundancy: a clause to which definition unfolding has been applied can be removed from the search space. To prove the completeness of stratified resolution with redundancies, we use a novel combination of Bachmair and Ganzingerâ??s model construction technique and a hierarchical construction of orderings and least fixpoints.

On the EA-style integrated processing of self-contained mathematical texts

A sound and complete first-order goal-oriented sequent-type calculus is developed with ``large-block'' inference rules. In particular, the calculus contains formal analogues of such natural proof-search techniques as handling definitions and applying auxiliary propositions.