Search results for "Information Science"
showing 10 items of 3627 documents
Online environmental activism and Internet use in the Indonesian environmental movement
2013
Author's version of an article in the journal: Information Development. Also available from the publisher at: http://dx.doi.org/10.1177/0266666913485260 This article investigates the use of the Internet among Indonesian environmental non-governmental organizations (ENGOs) and how this use influences the mobilizing structure of the environmental movement. The discussion is informed by an explorative study of nineteen Indonesian ENGOs working in the domain of forest protection. The study reveals that the Internet empowers the environmental activism of these organizations by enhancing opportunities for political participation. A main finding in the article is that well-established organization…
Antibiotics and food in the American press
2021
AbstractThe emergence of antimicrobial resistant infections from food is well documented in the scientific literature but, in this kind of matter, the public opinion is an important policy driver and is vastly forged by traditional media. Here, we propose a text mining study through about 500 articles from two reference daily U.S. newspapers to assess the media coverage of this issue. Our results indicate that, since the middle of the 80s, the two journals considered here adopted a very different narrative around the issue, echoing civil society concerns in one case and the official discourse in the other.
Características y visibilidad de las revistas españolas de ciencias de la salud en bases de datos
2015
Se describen las características de 207 revistas españolas de ciencias de la salud activas en 2014 y su visibilidad en seis bases de datos biomédicas y multidisciplinares. Scopus e Ibecs son las bases de datos que mayor número de revistas cubren, y Medline y WoS las que menos. La disciplina mejor representada es medicina, seguida de psicología, enfermería y farmacia. Se observa la práctica ausencia de revistas editadas exclusivamente en papel, la existencia de revistas publicadas en inglés, el aumento de versiones bilingües español-inglés y el acceso gratuito a los contenidos. El artículo incorpora el censo de revistas, que puede servir de referencia para los investigadores para selecciona…
Dietas confinadas: análisis del discurso de la prensa sobre la nutrición en tiempos de Covid-19
2021
The essential elements of the Spanish press’s discourse on nutrition guidelines during the Covid-19 health crisis are identified. To do this, the evolution of media representation is examined, with a semantic analysis of the news appearing in the national media in Spanish regarding nutrition and Covid-19. The analyzed period is from 31 January 2020 to 31 January 2021. The content search carried out using the Factiva database identified 117 records, which were analysed using T-LAB software. The results reveal that the press warned of hoaxes regarding nutrition during the study period. Four semantic groups are identified, informing about the most appropriate eating patterns according to the d…
Elements of Language Theory
1988
In this chapter we shall review the mathematical and computer science background on which the presentation in this book is based. We shall discuss the elements of discrete mathematics and formal language theory, emphasizing those issues that are of importance from the point of view of context-free parsing. We shall devote a considerable part of this chapter to matters such as random access machines and computational complexity. These will be relevant later when we derive efficient algorithms for parsing theoretic problems or prove lower bounds for the complexity of these problems. In this chapter we shall also discuss a general class of formal language descriptors called “rewriting systems”…
Debates with Small Transparent Quantum Verifiers
2014
We study a model where two opposing provers debate over the membership status of a given string in a language, trying to convince a weak verifier whose coins are visible to all. We show that the incorporation of just two qubits to an otherwise classical constant-space verifier raises the class of debatable languages from at most NP to the collection of all Turing-decidable languages (recursive languages). When the verifier is further constrained to make the correct decision with probability 1, the corresponding class goes up from the regular languages up to at least E.
The expressive power of the shuffle product
2010
International audience; There is an increasing interest in the shuffle product on formal languages, mainly because it is a standard tool for modeling process algebras. It still remains a mysterious operation on regular languages.Antonio Restivo proposed as a challenge to characterize the smallest class of languages containing the singletons and closed under Boolean operations, product and shuffle. This problem is still widely open, but we present some partial results on it. We also study some other smaller classes, including the smallest class containing the languages composed of a single word of length 2 which is closed under Boolean operations and shuffle by a letter (resp. shuffle by a l…
Fast Matrix Multiplication
2015
Until a few years ago, the fastest known matrix multiplication algorithm, due to Coppersmith and Winograd (1990), ran in time O(n2.3755). Recently, a surge of activity by Stothers, Vassilevska-Williams, and Le~Gall has led to an improved algorithm running in time O(n2.3729). These algorithms are obtained by analyzing higher and higher tensor powers of a certain identity of Coppersmith and Winograd. We show that this exact approach cannot result in an algorithm with running time O(n2.3725), and identify a wide class of variants of this approach which cannot result in an algorithm with running time $O(n^{2.3078}); in particular, this approach cannot prove the conjecture that for every e > 0, …
On a class of languages with holonomic generating functions
2017
We define a class of languages (RCM) obtained by considering Regular languages, linear Constraints on the number of occurrences of symbols and Morphisms. The class RCM presents some interesting closure properties, and contains languages with holonomic generating functions. As a matter of fact, RCM is related to one-way 1-reversal bounded k-counter machines and also to Parikh automata on letters. Indeed, RCM is contained in L-NFCM but not in L-DFCM, and strictly includes L-CPA. We conjecture that L-DFCM subset of RCM
Frames for fusions of modal logics
2018
Let us consider multimodal logics and . We assume that is characterised by a class of connected frames, and there exists an -frame with a so-called -starting point. Similarly, the logic is characterised by a class of connected frames, and there exists an -frame with a -starting point. Using isomorphic copies of the frames and , we construct a connected frame which characterises the fusion . The frame thus obtained has some useful properties. Among others, is countable if both and are countable, and there is a special world of the frame such that any formula is valid in the frame if and only if it is valid at the point . We also describe a similar construction where we assume the existence o…