ALBERT

Beschreibung: The availability in machine-readable form of descriptions of the structure of documents, as well as of the document discourse (e.g. the scientific discourse within scholarly articles), is crucial for facilitating semantic publishing and the overall comprehension of documents by both users and machines. In this paper we introduce DoCO, the Document Components Ontology, an OWL 2 DL ontology that provides a general-purpose structured vocabulary of document elements to describe both structural and rhetorical document components in RDF. In addition to describing the formal description of the ontology, this paper showcases its utility in practice in a variety of our own applications and other activities of the Semantic Publishing community that rely on DoCO to annotate and retrieve document components of scholarly articles. Content Type Journal Article Pages - DOI 10.3233/SW-150177 Authors Alexandru Constantin, École Polytechnique Fédérale de Lausanne, PFL IC IIF LSIR, BC 159 (Bâtiment BC), Station 14, CH-1015 Lausanne, Switzerland. E-mail: alex.constantin@epfl.ch Silvio Peroni, Department of Computer Science and Engineering, University of Bologna, Mura Anteo Zamboni 7, 40127 Bologna (BO), Italy. E-mails: silvio.peroni@unibo.it, fabio.vitali@unibo.it Steve Pettifer, School of Computer Science, University of Manchester, Kilburn Building, M13 9PL Manchester, United Kingdom. E-mail: steve.pettifer@manchester.ac.uk David Shotton, Oxford e-Research Centre, University of Oxford, 7 Keble Road, OX1 3QG Oxford, United Kingdom. E-mail: david.shotton@oerc.ox.ac.uk Fabio Vitali, Department of Computer Science and Engineering, University of Bologna, Mura Anteo Zamboni 7, 40127 Bologna (BO), Italy. E-mails: silvio.peroni@unibo.it, fabio.vitali@unibo.it Journal Semantic Web Online ISSN 2210-4968 Print ISSN 1570-0844

Beschreibung: This study presents theoretical proof and empirical evidence of the reduction algorithm convergence for the distance-based inconsistency in pairwise comparisons. Our empirical research shows that the convergence very quick. It usually takes less than 10 reductions to bring the inconsistency of the pairwise comparisons matrix below the assumed threshold of 1/3 (sufficient for most applications). We believe that this is the first Monte Carlo study demonstrating such results for the convergence speed of inconsistency reduction in pairwise comparisons. Content Type Journal Article Pages 355-367 DOI 10.3233/FI-2015-1184 Authors Waldemar W. Koczkodaj, Computer Science, Laurentian University, 935 Ramsey Lake Road, Sudbury, ON P3E 2C6, Canada. wkoczkodaj@cs.laurentian.ca Marek Kosiek, Jagiellonian University, Department of Mathematics and Computer Science, Prof. St. Łojasiewicza 6, 30-348 Kraków, Poland. Marek.Kosiek@im.uj.edu.pl Jacek Szybowski, AGH University of Science and Technology, Faculty of Applied Mathematics, al. Mickiewicza 30, 30-059 Kraków, Poland. szybowsk@agh.edu.pl Ding Xu, Computer Science, Laurentian University, 935 Ramsey Lake Road, Sudbury, ON P3E 2C6, Canada Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 137 Journal Issue Volume 137, Number 3 / 2015

Beschreibung: [Introduction] Schedule management of hospitalization is important to maintain or improve the quality of medical care and application of a clinical pathway is one of the important solutions for the management. Although several kinds of deductive methods for construction for a clinical pathway have been proposed, the customization is one of the important problems. This research proposed an inductive approach to support the customization of existing clinical pathways by using data on nursing actions stored in a hospital information system. [Method] The number of each nursing action applied to a given disease during the hospitalization was counted for each day as a temporal sequence. Temporal sequences were compared by using clustering and multidimensional scaling method in order to visualize the similarities between temporal patterns of clinical actions. [Results] Clustering and multidimensional scaling analysis classified these orders to one group necessary for the treatment for this DPC and the other specific to the status of a patient. The method was evaluated on data sets of ten frequent diseases extracted from hospital information system in Shimane University Hospital. Cataracta and Glaucoma were selected. Removing routine and poorly documented nursing actions, 46 items were selected for analysis. [Discussion] Counting data on executed nursing orders were analyzed as temporal sequences by using similarity-based analysis methods. The analysis classified the nursing actions into the two major groups: one consisted of orders necessary for the treatment and the other consisted of orders dependent on the status of admitted patients, including complicated diseases, such as DM or heart diseases. The method enabled us to inductive construction of standardized schedule management and detection of the conditions of patients difficult to apply the existing or induced clinical pathway. Content Type Journal Article Pages 237-252 DOI 10.3233/FI-2015-1177 Authors Haruko Iwata, Department of Medical Informatics, Faculty of Medicine, Shimane University, 89-1 Enya-cho Izumo 693-8501, Japan. {haruko23,hirano,tsumoto}@med.shimane-u.ac.jp Shoji Hirano, Department of Medical Informatics, Faculty of Medicine, Shimane University, 89-1 Enya-cho Izumo 693-8501, Japan. {haruko23,hirano,tsumoto}@med.shimane-u.ac.jp Shusaku Tsumoto, Department of Medical Informatics, Faculty of Medicine, Shimane University, 89-1 Enya-cho Izumo 693-8501, Japan. {haruko23,hirano,tsumoto}@med.shimane-u.ac.jp Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 137 Journal Issue Volume 137, Number 2 / 2015

Beschreibung: At the end of the eighties, continuous Petri nets were introduced for: (1) alleviating the combinatory explosion triggered by discrete Petri nets (i.e. usual Petri nets) and, (2) modelling the behaviour of physical systems whose state is composed of continuous variables. Since then several works have established that the computational complexity of deciding some standard behavioural properties of Petri nets is reduced in this framework. Here we first establish the decidability of additional properties like coverability, boundedness and reachability set inclusion. We also design new decision procedures for reachability and lim-reachability problems with a better computational complexity. Finally we provide lower bounds characterising the exact complexity class of the reachability, the coverability, the boundedness, the deadlock freeness and the liveness problems. A small case study is introduced and analysed with these new procedures. Content Type Journal Article Pages 1-28 DOI 10.3233/FI-2015-1168 Authors Estíbaliz Fraca, Instituto de Investigación en Ingeniería de Aragón (I3A), Universidad de Zaragoza, Zaragoza, Spain. efraca@unizar.es Serge Haddad, Ecole Normale Supérieure de Cachan, LSV, CNRS UMR 8643, INRIA, Cachan, France. haddad@lsv.ens-cachan.fr Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 137 Journal Issue Volume 137, Number 1 / 2015

Beschreibung: We propose a framework in terms of domain theory for semantic information models. We show how an artificial agent (the computer) can operate within such a model in a multiple attitude environment (fuzziness) where information is conveyed. We illustrate our approach by two examples — taking as the set of the degrees of reliability Kleene's 3-valued strong logic and Belnap-Dunn's 4-valued logic. Content Type Journal Article Pages 207-225 DOI 10.3233/FI-2015-1208 Authors Alexei Y. Muravitsky, Louisiana Scholars' College, Northwestern State University, Natchitoches, LA 71497, USA. alexeim@nsula.edu Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 138 Journal Issue Volume 138, Number 1-2 / 2015

Beschreibung: Yurii Rogozhin's Biography and Publications Content Type Journal Article Pages 273-284 DOI 10.3233/FI-2015-1212 Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 138 Journal Issue Volume 138, Number 1-2 / 2015

Beschreibung: We propose and investigate a formal language operation inspired by the naturally occurring phenomenon of DNA primer extension by a DNA-template-directed DNA Polymerase enzyme. Given two DNA strings u and v, where the shorter string v (called primer) is Watson-Crick complementary and can thus bind to a substring of the longer string u (called template) the result of the primer extension is a DNA string that is complementary to a suffix of the template which starts at the binding position of the primer. The operation of DNA primer extension can be abstracted as a binary operation on two formal languages: a template language L 1 and a primer language L 2 . We call this language operation L 1 -directed extension of L 2 and study the closure properties of various language classes, including the classes in the Chomsky hierarchy, under directed extension. Furthermore, we answer the question under what conditions can a given language of target strings be generated from a given template language when the primer language is unknown. We use the canonic inverse of directed extension in order to obtain the optimal solution (the minimal primer language) to this question. Content Type Journal Article Pages 179-192 DOI 10.3233/FI-2015-1206 Authors Srujan Kumar Enaganti, Department of Computer Science, The University of Western Ontario, London, ON N6A 5B7, Canada. senagant@uwo.ca; lila.kari@uwo.ca; steffen@csd.uwo.ca Lila Kari, Department of Computer Science, The University of Western Ontario, London, ON N6A 5B7, Canada. senagant@uwo.ca; lila.kari@uwo.ca; steffen@csd.uwo.ca Steffen Kopecki, Department of Computer Science, The University of Western Ontario, London, ON N6A 5B7, Canada. senagant@uwo.ca; lila.kari@uwo.ca; steffen@csd.uwo.ca Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 138 Journal Issue Volume 138, Number 1-2 / 2015

Beschreibung: In this paper we investigate the use of general topological spaces in connection with a generalised variant of membrane systems. We provide an approach which produces a fine grain description of local operations occurring simultaneously in sets of compartments of the system by restricting the interactions between objects. This restriction is given by open sets of a topology and multisets of objects associated with them, which dynamically change during the functioning of the system and which together define a notion of vicinity for the objects taking part in the interactions. Content Type Journal Article Pages 193-205 DOI 10.3233/FI-2015-1207 Authors Erzsébet Csuhaj-Varjú, Department of Algorithms and Their Applications, Faculty of Informatics, Eötvös Loránd University, Pázmány Péter sétány 1/c, 1117 Budapest, Hungary. csuhaj@inf.elte.hu Marian Gheorghe, Department of Computer Science, University of Sheffield, Regent Court, 211 Portobello, Sheffield S1 4DP, United Kingdom. m.gheorghe@sheffield.ac.uk, m.stannett@sheffield.ac.uk Mike Stannett, Department of Computer Science, University of Sheffield, Regent Court, 211 Portobello, Sheffield S1 4DP, United Kingdom. m.gheorghe@sheffield.ac.uk, m.stannett@sheffield.ac.uk György Vaszil, Department of Computer Science, Faculty of Informatics, University of Debrecen, Kassai út 26, 4028 Debrecen, Hungary. vaszil.gyorgy@inf.unideb.hu Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 138 Journal Issue Volume 138, Number 1-2 / 2015

Beschreibung: We discuss simple functional transductions defined by invertible Mealy automata under iteration and in particular the question when the orbit relation defined by iteration is rational. We identify a class of these automata that has relatively complicated orbits, yet some of them are still orbit rational and discuss a number of decision problems associated with these devices. Content Type Journal Article Pages 259-272 DOI 10.3233/FI-2015-1211 Authors K. Sutner, Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213, USA. sutner@cs.cmu.edu Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 138 Journal Issue Volume 138, Number 1-2 / 2015

Beschreibung: Elementary cellular automata (ECA) are linear arrays of finite-state machines (cells) which take binary states, and update their states simultaneously depending on states of their closest neighbours. We design and study ECA with memory (ECAM), where every cell remembers its states during some fixed period of evolution. We characterize complexity of ECAM in a case study of rule 126, and then provide detailed behavioural classification of ECAM. We show that by enriching ECA with memory we can achieve transitions between the classes of behavioural complexity. We also show that memory helps to ‘discover’ hidden information and behaviour on trivial (uniform, periodic), and non-trivial (chaotic, complex) dynamical systems. Content Type Journal Article Pages 1-16 DOI 10.3233/FI-2015-1194 Authors Genaro J. Martínez, Escuela Superior de Cómputo, Instituto Politécnico Nacional, México D.F., México, International Centre of Unconventional Computing, University of the West of England, BS16 1QY Bristol, United Kingdom. Genaro.Martinez@uwe.ac.uk Andrew Adamatzky, International Centre of Unconventional Computing, University of the West of England, BS16 1QY Bristol, United Kingdom. Andrew.Adamatzky@uwe.ac.uk Ramon Alonso-Sanz, Universidad Politecnica de Madrid. ETSIA (Estadistica,GSC), Madrid, Spain. Ramon.Alonso@upm.es Journal Fundamenta Informaticae Online ISSN 1875-8681 Print ISSN 0169-2968 Journal Volume Volume 138 Journal Issue Volume 138, Number 1-2 / 2015