Public participation in futuring:A systematic literature review

Against the background of continuous calls to democratize futures research and practice, this paper reports the results of a systematic literature review of the involvement of publics in participatory futuring processes. The paper considers three key research questions: Who participates in public futuring processes? Why are publics included in these processes? And what roles do they occupy? By considering practices of participation in futuring, we aim to build a comprehensive picture of the participatory futuring landscape and highlight elements of process design that may enhance or diminish a process's democratic potential. We conclude by suggesting directions for possible future research that could serve the field's continuing desire to democratize and further integrate participatory and critical approaches to futuring.</p

Public participation in futuring:A systematic literature review

Against the background of continuous calls to democratize futures research and practice, this paper reports the results of a systematic literature review of the involvement of publics in participatory futuring processes. The paper considers three key research questions: Who participates in public futuring processes? Why are publics included in these processes? And what roles do they occupy? By considering practices of participation in futuring, we aim to build a comprehensive picture of the participatory futuring landscape and highlight elements of process design that may enhance or diminish a process's democratic potential. We conclude by suggesting directions for possible future research that could serve the field's continuing desire to democratize and further integrate participatory and critical approaches to futuring.</p

Hierarchical models for service-oriented systems

We present our approach to the denotation and representation of hierarchical graphs: a suitable algebra of hierarchical graphs and two domains of interpretations. Each domain of interpretation focuses on a particular perspective of the graph hierarchy: the top view (nested boxes) is based on a notion of embedded graphs while the side view (tree hierarchy) is based on gs-graphs. Our algebra can be understood as a high-level language for describing such graphical models, which are well suited for defining graphical representations of service-oriented systems where nesting (e.g. sessions, transactions, locations) and linking (e.g. shared channels, resources, names) are key aspects

Video Assisted Thoracoscopic Treatment of Pleuropericardial Cysts

Question of the Study In this study, safety and feasibility of thoracoscopic fenestration of pleuropericardial cysts under local and general anaesthesia is evaluated. Besides, a rare case of a pleural cyst, causing a superior vena cava syndrome, is described

Metallicity determination in gas-rich galaxies with semiempirical methods

A study of the precision of the semiempirical methods used in the determination of the chemical abundances in gas-rich galaxies is carried out. In order to do this the oxygen abundances of a total of 438 galaxies were determined using the electronic temperature, the $R_{23}$ and the P methods. The new calibration of the P method gives the smaller dispersion for the low and high metallicity regions, while the best numbers in the turnaround region are given by the $R_{23}$ method. We also found that the dispersion correlates with the metallicity. Finally, it can be said that all the semiempirical methods studied here are quite insensitive to metallicity with a value of $8.0\pm0.2$ dex for more than 50% of the total sample. \keywords{ISM: abundances; (ISM): H {\sc ii} regions}Comment: 26 pages, 9 figures and 2 tables. To appear at AJ, January 200

OntoMathPROOntoMath^{PRO} Ontology: A Linked Data Hub for Mathematics

In this paper, we present an ontology of mathematical knowledge concepts that covers a wide range of the fields of mathematics and introduces a balanced representation between comprehensive and sensible models. We demonstrate the applications of this representation in information extraction, semantic search, and education. We argue that the ontology can be a core of future integration of math-aware data sets in the Web of Data and, therefore, provide mappings onto relevant datasets, such as DBpedia and ScienceWISE.Comment: 15 pages, 6 images, 1 table, Knowledge Engineering and the Semantic Web - 5th International Conferenc

A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems

Basic proof-search tactics in logic and type theory can be seen as the root-first applications of rules in an appropriate sequent calculus, preferably without the redundancies generated by permutation of rules. This paper addresses the issues of defining such sequent calculi for Pure Type Systems (PTS, which were originally presented in natural deduction style) and then organizing their rules for effective proof-search. We introduce the idea of Pure Type Sequent Calculus with meta-variables (PTSCalpha), by enriching the syntax of a permutation-free sequent calculus for propositional logic due to Herbelin, which is strongly related to natural deduction and already well adapted to proof-search. The operational semantics is adapted from Herbelin's and is defined by a system of local rewrite rules as in cut-elimination, using explicit substitutions. We prove confluence for this system. Restricting our attention to PTSC, a type system for the ground terms of this system, we obtain the Subject Reduction property and show that each PTSC is logically equivalent to its corresponding PTS, and the former is strongly normalising iff the latter is. We show how to make the logical rules of PTSC into a syntax-directed system PS for proof-search, by incorporating the conversion rules as in syntax-directed presentations of the PTS rules for type-checking. Finally, we consider how to use the explicitly scoped meta-variables of PTSCalpha to represent partial proof-terms, and use them to analyse interactive proof construction. This sets up a framework PE in which we are able to study proof-search strategies, type inhabitant enumeration and (higher-order) unification

A Paraconsistent Higher Order Logic

Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to achieve there are many potential applications of paraconsistent logics in knowledge-based systems, logical semantics of natural language, etc. Higher order logics have the advantages of being expressive and with several automated theorem provers available. Also the type system can be helpful. We present a concise description of a paraconsistent higher order logic with countable infinite indeterminacy, where each basic formula can get its own indeterminate truth value (or as we prefer: truth code). The meaning of the logical operators is new and rather different from traditional many-valued logics as well as from logics based on bilattices. The adequacy of the logic is examined by a case study in the domain of medicine. Thus we try to build a bridge between the HOL and MVL communities. A sequent calculus is proposed based on recent work by Muskens.Comment: Originally in the proceedings of PCL 2002, editors Hendrik Decker, Joergen Villadsen, Toshiharu Waragai (http://floc02.diku.dk/PCL/). Correcte

Projecting the future smoking prevalence in Norway

Background: Norway has achieved a noteworthy reduction in smoking prevalence over the past forty years. In 2015, 13% of Norwegians aged 13-74 smoked daily and a further 9% smoked occasionally. One of the objectives of the Norwegian 2013-16 national strategy for tobacco control is to achieve a reduction in the daily smoking prevalence t