15,568 research outputs found
Film education project with youth
There is a broad consensus on the recognition of cinema as a means of acquiring media literacy. The problematization of cinema as an artistic expression and the promotion of interdisciplinarity between the areas of communication, cinema and education and artistic education in particular that have been established in the field
of communication science teaching. In this context, the purpose of this article is to describe action-research projects that are repeated annually, when students are confronted with cinema, audiovisual language, analysis of still and moving images, the follow-up of documentary creation with students from different courses, and their
involvement in the dynamization of an audiovisual space from the text of a Portuguese writer, Almada Negreiros "Manifesto Anti Dantas" or interviews in rural communities, using video cameras, within the International Project Rural 3.0 Service-Learning for Rural Development, which is an international transversal project, funded in July 2018 by E+ Knowledge Alliances, coordinated by the School of Education of the Polytechnic Institute of Viana do Castelo, involving sixteen partners from eight European countries.Erasmus + Programme of the European Union, under the development
of the project entitled “3.0- Service Learning for the Rural Development” | Promotor: Instituto Politécnico de
Viana do Casteloinfo:eu-repo/semantics/publishedVersio
Fast Distributed Computation of Distances in Networks
This paper presents a distributed algorithm to simultaneously compute the
diameter, radius and node eccentricity in all nodes of a synchronous network.
Such topological information may be useful as input to configure other
algorithms. Previous approaches have been modular, progressing in sequential
phases using building blocks such as BFS tree construction, thus incurring
longer executions than strictly required. We present an algorithm that, by
timely propagation of available estimations, achieves a faster convergence to
the correct values. We show local criteria for detecting convergence in each
node. The algorithm avoids the creation of BFS trees and simply manipulates
sets of node ids and hop counts. For the worst scenario of variable start
times, each node i with eccentricity ecc(i) can compute: the node eccentricity
in diam(G)+ecc(i)+2 rounds; the diameter in 2*diam(G)+ecc(i)+2 rounds; and the
radius in diam(G)+ecc(i)+2*radius(G) rounds.Comment: 12 page
Recognizing pro-R closures of regular languages
Given a regular language L, we effectively construct a unary semigroup that
recognizes the topological closure of L in the free unary semigroup relative to
the variety of unary semigroups generated by the pseudovariety R of all finite
R-trivial semigroups. In particular, we obtain a new effective solution of the
separation problem of regular languages by R-languages
Dependability in Aggregation by Averaging
Aggregation is an important building block of modern distributed
applications, allowing the determination of meaningful properties (e.g. network
size, total storage capacity, average load, majorities, etc.) that are used to
direct the execution of the system. However, the majority of the existing
aggregation algorithms exhibit relevant dependability issues, when prospecting
their use in real application environments. In this paper, we reveal some
dependability issues of aggregation algorithms based on iterative averaging
techniques, giving some directions to solve them. This class of algorithms is
considered robust (when compared to common tree-based approaches), being
independent from the used routing topology and providing an aggregation result
at all nodes. However, their robustness is strongly challenged and their
correctness often compromised, when changing the assumptions of their working
environment to more realistic ones. The correctness of this class of algorithms
relies on the maintenance of a fundamental invariant, commonly designated as
"mass conservation". We will argue that this main invariant is often broken in
practical settings, and that additional mechanisms and modifications are
required to maintain it, incurring in some degradation of the algorithms
performance. In particular, we discuss the behavior of three representative
algorithms Push-Sum Protocol, Push-Pull Gossip protocol and Distributed Random
Grouping under asynchronous and faulty (with message loss and node crashes)
environments. More specifically, we propose and evaluate two new versions of
the Push-Pull Gossip protocol, which solve its message interleaving problem
(evidenced even in a synchronous operation mode).Comment: 14 pages. Presented in Inforum 200
- …