On the consequences of a Mihlin-H\"ormander functional calculus: maximal and square function estimates

We prove that the existence of a Mihlin-H\"ormander functional calculus for an operator $L$ implies the boundedness on $L^p$ of both the maximal operators and the continuous square functions build on spectral multipliers of $L.$ The considered multiplier functions are finitely smooth and satisfy an integral condition at infinity. In particular multipliers of compact support are admitted

European Union Trade Policy Towards China, Japan and South Korea

Rozdział z: The Quandaries and Foreign Development, ed. D. Mierzejewski, “Contemporary Asian Studies Series

Evolving small spiking neural networks to work as state machines for temporal pattern recognition

Peer reviewe

Unifiability and Structural Completeness in Relation Algebras and in Products of Modal Logic S5

Unifiability of terms (and formulas) and structural completeness in the variety of relation algebras RA and in the products of modal logic S5 is investigated. Nonunifiable terms (formulas) which are satisfiable in varieties (in logics) are exhibited. Consequently, RA and products of S5 as well as representable diagonal-free n-dimensional cylindric algebras, RDfn, are almost structurally complete but not structurally complete. In case of S5ⁿ a basis for admissible rules and the form of all passive rules are provided

Evolution and development of complex computational systems using the paradigm of metabolic computing in Epigenetic Tracking

Epigenetic Tracking (ET) is an Artificial Embryology system which allows for the evolution and development of large complex structures built from artificial cells. In terms of the number of cells, the complexity of the bodies generated with ET is comparable with the complexity of biological organisms. We have previously used ET to simulate the growth of multicellular bodies with arbitrary 3-dimensional shapes which perform computation using the paradigm of "metabolic computing". In this paper we investigate the memory capacity of such computational structures and analyse the trade-off between shape and computation. We now plan to build on these foundations to create a biologically-inspired model in which the encoding of the phenotype is efficient (in terms of the compactness of the genome) and evolvable in tasks involving non-trivial computation, robust to damage and capable of self-maintenance and self-repair.Comment: In Proceedings Wivace 2013, arXiv:1309.712