Search

Este texto, resultado de la labor investigativa dediversos/as académicos/as del Centro de Estudios de la Actualidad Nacional de la Universidad de Santiago de Chile, busca entregar reflexiones, pistas y propuestas para responder a diversas interrogantes teóricas y metodológicas ligadas a la información política, científica o personal, teniendo por eje lo que está ocurriendo en la sociedad chilena actual. La idea es ayudar a nuestros contemporáneos a navegar en el inmenso océano de la información digitalizada que viene acompañada de incesantes estrategias persuasivas que nos facilitan la vida, pero que, también, nos exponen a consecuencias indeseadas.

Análisis de contenido Breve historia Una definición clásica para el análisis de contenido es la de “una técnica de investigación para la descripción objetiva, sistemática y cuantitativa del contenido manifiesto de la comunicación” (Berelson, 1952). El especialista en cibernética y lingüística, Klaus Krippendorff, por su parte, lo define como una “técnica de investigación que permite realizar inferencias válidas y replicables a partir de textos (u otras fuentes de contenido), enmarcados dentro...

International audience; During the last years, several sensor-based monitoring systems have been developed to detect in real time frequent problems in older people, such as falls and nocturia. Some devices can also measure different variables of the environment (e.g. temperature, pollution, etc.) to generate alarms and thus help the user's welfare. All these devices generate numerous sensitive data related to the health and behavior of user/patients. The presence of some of these sensors in homes can mean a vulnerability of the user’s privacy. In this article we propose a telemonitoring ADL platform based on non-intrusive sensors for the care of the elderly, restricted by a user-centered protocol that guarantees their privacy and facilitates their acceptance by the user.

The binomial system is an electoral system unique in the world. It was used to elect the senators and deputies of Chile during 27 years, from the return of democracy in 1990 until 2017. In this paper we study the real voting power of the different political parties in the Senate of Chile during the whole binomial period. We not only consider the different legislative periods, but also any party changes between one period and the next. The real voting power is measured by considering power indices from cooperative game theory, which are based on the capability of the political parties to form winning coalitions. With this approach, we can do an analysis that goes beyond the simple count of parliamentary seats.

We study the computational complexity of an important property of simple, regular and weighted games, which is decisiveness. We show that this concept can naturally be represented in the context of hypergraph theory, and that decisiveness can be decided for simple games in quasi-polynomial time, and for regular and weighted games in polynomial time. The strongness condition poses the main difficulties, while properness reduces the complexity of the problem, especially if it is amplified by regularity. On the other hand, regularity also allows to specify the problem instances much more economically, implying a reconsideration of the corresponding complexity measure that, as we prove, has important structural as well as algorithmic consequences., Comment: 12 pages

We consider a simple and altruistic multiagent system in which the agents are eager to perform a collective task but where their real engagement depends on the willingness to perform the task of other influential agents. We model this scenario by an influence game, a cooperative simple game in which a team (or coalition) of players succeeds if it is able to convince enough agents to participate in the task (to vote in favor of a decision). We take the linear threshold model as the influence model. We show first the expressiveness of influence games showing that they capture the class of simple games. Then we characterize the computational complexity of various problems on influence games, including measures (length and width), values (Shapley-Shubik and Banzhaf) and properties (of teams and players). Finally, we analyze those problems for some particular extremal cases, with respect to the propagation of influence, showing tighter complexity characterizations., Comment: 23 pages