Canvas8, the leading behavioural insights agency, are delighted to announce the release of their biannual trending document, Keeping TABS Q2 2011.
The document is a summary of the most important trends and drivers currently influencing global consumer culture.
TABS is an acronym of Trends, Anthropology, Behaviour and Strategy - the four components necessary in understanding global societal developments. Information has been sourced from academic journals, hundreds of industry blogs and the minds of an exclusive network of globally recognised Thought Leaders.
Whilst tracking the progress of trends documented in the previous Keeping TABS, the report also identifies new emerging consumer trends such as: Byegender; Life as an Enterprise; Serendipity and Being+
Canvas8, the leading behavioural insights agency, are delighted to announce the release of their biannual trending document, Keeping TABS Q2 2011.
The document is a summary of the most important trends and drivers currently influencing global consumer culture.
TABS is an acronym of Trends, Anthropology, Behaviour and Strategy - the four components necessary in understanding global societal developments. Information has been sourced from academic journals, hundreds of industry blogs and the minds of an exclusive network of globally recognised Thought Leaders.
Whilst tracking the progress of trends documented in the previous Keeping TABS, the report also identifies new emerging consumer trends such as: Byegender; Life as an Enterprise; Serendipity and Being+
Consistency proof of a feasible arithmetic inside a bounded arithmeticYamagata Yoriyuki
1) The author proves that the consistency of the bounded arithmetic theory S12 can be proved in the weaker theory PV-, which is Cook and Urquhart's equational theory PV minus induction. This is a strengthening of previous results that placed the lower bound at weaker but related theories.
2) The proof works by defining a system C for feasibly computing terms in PV- and proving it is sound with respect to PV-. Since C cannot prove false statements, this implies the consistency of PV-.
3) Establishing this lower bound of PV- is significant for attempts to separate the theories S2 and S12 by relative consistency statements.
This document summarizes a runtime verification framework that monitors network applications using CSP (Communicating Sequential Processes) notation. It currently implements a monitor for system calls in dtruss output to check if open and close calls are matched. The goals are natural concurrency notations, integration with web servers, databases and syslog. Future work includes completing the file descriptor model, improving error reporting, and interfacing with Fluentd for log parsing.
Consistency proof of a feasible arithmetic inside a bounded arithmeticYamagata Yoriyuki
This document discusses consistency proofs of feasible arithmetics inside bounded arithmetics. It presents the main results that S12, the first level of Buss's hierarchy of bounded arithmetics, proves the consistency of PV−, an equational theory formulated by Cook and Urquhart. This is shown using a big-step semantics and soundness proofs for PV−. The document defines the semantics and inference rules for computations in PV−, and proves lemmas bounding the size of computations to establish the consistency of PV− in S12.
Consistency proof of a feasible arithmetic inside a bounded arithmeticYamagata Yoriyuki
In this paper, we prove that S21 can prove consistency of PV−, the system obtained from Cook and Urquhart’s PV [3] by removing induction. This apparently contradicts Buss and Ignjatovi ́c [2], since they prove that PV ̸⊢ Con(PV−). However, what they actually prove is unprovability of consistency of the system which is obtained from PV− by addition of propositional logic and BASICe-axioms. On the other hand, our PV− is strictly equational and our proof relies on it.
This document discusses Buss's theories of bounded arithmetic (S2i) and how they relate to the polynomial hierarchy (PH). It proposes using the separation of Buss's theories to approach the separation of levels of PH. It presents a consistency proof for S2i inside S2i+2 by introducing a predicate E for term existence and defining a bounded truth definition. The goal is to separate S2i and S2i+2 through Gödel's incompleteness theorem by showing S2i+2 can prove the i-consistency of S2i-E but S2i cannot prove its own consistency. Future work aims to simplify S2i-E and formally prove S2i can derive the i
This document discusses bounded arithmetic in free logic. It defines the theory S2iE, which is bounded arithmetic without truth values for terms. It proves that:
1) S2iE can "bootstrap" and prove basic properties, equality axioms, and predicate logic.
2) S2iE proves Σi-induction.
3) S2i-1E can be shown to be i-consistent within S2i+2E by defining a bounded truth definition and using a valuation tree and induction hypothesis.
This separation of S2i and S2i+1 theories using S2i-1E is a potential research direction.
The document presents a formal semantics for Extended Hierarchical State Transition Matrix (EHSTM) by translating it to Communicating Sequential Processes (CSP). It describes translating EHSTM hierarchies and matrices to CSP processes and parallel/sequential composition. Experiments show the translation is over 1000 times faster than an existing SMT-based approach and results match for validation examples. The work provides a rigorous model for EHSTM and enables efficient model checking of properties.
This document summarizes Camomile, a Unicode library for OCaml. It provides a Unicode character type, supports UTF-8, UTF-16 and UTF-32 encodings, and allows conversion between 200+ encodings. It also supports case mapping, collation, and Unicode normal forms to handle equivalent string representations. The library uses functors and lazy evaluation. Modules provide Unicode normalization and canonical comparison of strings based on semantic equivalence.