La novela popular y "2666" (2004) de Roberto Bolaño

En estas líneas se demuestra que “De la parte de Archimboldi”, un capítulo de 2666 (2004) de Roberto Bolaño (1947–2000), se puede unir con la corriente de novelas populares de corte realista que comenzó en la segunda mitad del siglo XIX. La novela posmoderna une en sí elementos populares y elementos pertenecientes a una cultura minoritaria, pero hace falta analizar ejemplos concretos de obras recientes que lo confirmen. Al encontrar los elementos populares que distinguen a 2666 (2004), contribuimos a estudiar la novela hispanoamericana actual siguiendo los pasos de investigadores como Vance R. Holloway y Gonzalo Navajas. El texto muestra cómo Roberto Bolaño toma rasgos de la novela popular pero utiliza sus códigos narrativos de un modo irónico y nuevo.

Efficient group communication for large-scale parallel clustering

Global communication requirements and load imbalance of some parallel data mining algorithms are the major obstacles to exploit the computational power of large-scale systems. This work investigates how non-uniform data distributions can be exploited to remove the global communication requirement and to reduce the communication cost in iterative parallel data mining algorithms. In particular, the analysis focuses on one of the most influential and popular data mining methods, the k-means algorithm for cluster analysis. The straightforward parallel formulation of the k-means algorithm requires a global reduction operation at each iteration step, which hinders its scalability. This work studies a different parallel formulation of the algorithm where the requirement of global communication can be relaxed while still providing the exact solution of the centralised k-means algorithm. The proposed approach exploits a non-uniform data distribution which can be either found in real world distributed applications or can be induced by means of multi-dimensional binary search trees. The approach can also be extended to accommodate an approximation error which allows a further reduction of the communication costs.

Iniciativa popular na concretização do direito fundamental à democracia

The Participatory Democracy is disseminated throughout the Principle of Popular Sovereignty. Since it spurs the participation of the people in the exercise of political power, it emerges as a conciliatory alternative to the Representative Regime - one of questionable legitimacy in account of the distortion it causes on the will of the public. It does so specially vis-à-vis the legislative, where the law is created. It s known that our Constitution (arts. 1º e 14, CF/88) provides for the means through which the members of the public may take part in the political process of the country, for it consecrates the plebiscite, the referendum and the popular initiative, all of them incipiently regulated by the Lei nº 9.709/98. It s our task, thus, to inquire, through deductive reasoning as well as the legal exegeses, the enforceability of the Popular Initiative as a means of popular emancipation, given that it enables the citizens to conscientiously participate in the public sphere. It has also an educational ethos which builds the capacity of individual to act, and, therefore, through thoughtful choices, enhance the legal system. Furthermore, the Lei da Ficha Limpa (LC nº 135/2010) surely represents a milestone in the Brazilian political history, since it accrued from a new way of social interaction allowed by the usage of communication technology on the pursuit of political morality. As a matter of fact, this bill is a clear example of how a legal act was legitimately proposed through Public Initiative. Hence, it s beneficial to actually make use of the Public Initiative, under the influence of the New Constitutional Hermeneutics, with a view to supporting social claims and promoting a dialogical relationship with the State in order to help it in the decisionmaking process. Thereat, we can achieve important civic spaces through which the fundamental right to democracy shall be materialized, tearing apart the old paradigms of inequality and, thus, promoting social justice

Rádio e educação popular na Amazônia: o processo comunicacional do Projeto Rádio pela Educação

O processo comunicacional que se observa no Projeto Rádio pela Educação, da Rádio Rural de Santarém, no centro da Amazônia, é o objeto deste relatório de pesquisa. O objetivo foi investigar como acontece esse processo no movimento existente entre a produção de um programa de rádio, as orientações dadas aos professores por meio de um guia pedagógico e as ações realizadas na escola, analisando a relação da comunicação radiofônica com as práticas educativas desenvolvidas. O trabalho seguiu o paradigma culturológico, entendendo a presença do rádio como parte de um processo de interação, de troca simbólica. Os procedimentos metodológicos tiveram abordagem indutiva, formando um conjunto de procedimentos com os métodos histórico e etnográfico, além de aspectos da pesquisa de recepção. As principais técnicas utilizadas foram pesquisa documental e bibliográfica, pesquisa de campo e observação, tomando como referência o enfoque qualitativo na observação, na descrição e na análise dos fenômenos a partir de algumas categorias: os agentes envolvidos, a escuta do programa, as mediações no conjunto do processo, a participação dos professores como mediadores e a perspectiva dialógica na dinâmica observada. Verificou-se que o processo comunicacional analisado se desenvolve em movimento de constante mudança, segue um ritmo que o transforma ao longo do tempo, a partir dos olhares e das intervenções de seus agentes ou mesmo das próprias motivações provocadas por sua ação no ambiente educacional, apresentando a coexistência do instrumental e do dialógico, tendo o rádio como um mediador no processo de aprendizagem.

Levante popular da juventude brasileira: saímos do Facebook

The paper studies the mobilization occurred in June 2013 in Brazil, initially under the banner of the Movement Free Pass, but without the existence of a lead, but multiple voices that alternate in search of social and economic change. The object of study is the communication made through social networks and their realization, or realization, the streets of major cities. The rallies demonstrate the power of communications media and a new phenomenon of talk, the use of social networks, now as uniting factor and not just a showcase of everyday life. The internet has become a new means of communication easy and free access, in addition to its fast dissipation data. Thus, the youth was used such technology to an uprising in the pursuit of social improvement of the cities where marches happened. Such a move still without an academic and social needs to be discussed so that, in addition to understood, can expand contributions to society, helping it in its claims. Was chosen as the site for the #causabrasil study and understanding of issues in which the public expresses dissatisfaction. The site performs an analysis with the combination of hastags a list of pre-registered and a list of terms used by different users of Facebook, Twitter, Instagram, Youtube and Google, through monitoring tool Seekr, and an infographic presents the main political demands of the population.

Levante popular da juventude brasileira: saímos do Facebook (on line)

The paper studies the mobilization occurred in June 2013 in Brazil, initially under the banner of the Movement Free Pass, but without the existence of a lead, but multiple voices that alternate in search of social and economic change. The object of study is the communication made through social networks and their realization, or realization, the streets of major cities. The rallies demonstrate the power of communications media and a new phenomenon of talk, the use of social networks, now as uniting factor and not just a showcase of everyday life. The internet has become a new means of communication easy and free access, in addition to its fast dissipation data. Thus, the youth was used such technology to an uprising in the pursuit of social improvement of the cities where marches happened. Such a move still without an academic and social needs to be discussed so that, in addition to understood, can expand contributions to society, helping it in its claims. Was chosen as the site for the #causabrasil study and understanding of issues in which the public expresses dissatisfaction. The site performs an analysis with the combination of hastags a list of pre-registered and a list of terms used by different users of Facebook, Twitter, Instagram, Youtube and Google, through monitoring tool Seekr, and an infographic presents the main political demands of the population.

Design and Performance Evaluation of Network-on-Chip Communication Protocols and Architectures

The scale down of transistor technology allows microelectronics manufacturers such as Intel and IBM to build always more sophisticated systems on a single microchip. The classical interconnection solutions based on shared buses or direct connections between the modules of the chip are becoming obsolete as they struggle to sustain the increasing tight bandwidth and latency constraints that these systems demand. The most promising solution for the future chip interconnects are the Networks on Chip (NoC). NoCs are network composed by routers and channels used to inter- connect the different components installed on the single microchip. Examples of advanced processors based on NoC interconnects are the IBM Cell processor, composed by eight CPUs that is installed on the Sony Playstation III and the Intel Teraflops pro ject composed by 80 independent (simple) microprocessors. On chip integration is becoming popular not only in the Chip Multi Processor (CMP) research area but also in the wider and more heterogeneous world of Systems on Chip (SoC). SoC comprehend all the electronic devices that surround us such as cell-phones, smart-phones, house embedded systems, automotive systems, set-top boxes etc... SoC manufacturers such as ST Microelectronics , Samsung, Philips and also Universities such as Bologna University, M.I.T., Berkeley and more are all proposing proprietary frameworks based on NoC interconnects. These frameworks help engineers in the switch of design methodology and speed up the development of new NoC-based systems on chip. In this Thesis we propose an introduction of CMP and SoC interconnection networks. Then focusing on SoC systems we propose: • a detailed analysis based on simulation of the Spidergon NoC, a ST Microelectronics solution for SoC interconnects. The Spidergon NoC differs from many classical solutions inherited from the parallel computing world. Here we propose a detailed analysis of this NoC topology and routing algorithms. Furthermore we propose aEqualized a new routing algorithm designed to optimize the use of the resources of the network while also increasing its performance; • a methodology flow based on modified publicly available tools that combined can be used to design, model and analyze any kind of System on Chip; • a detailed analysis of a ST Microelectronics-proprietary transport-level protocol that the author of this Thesis helped developing; • a simulation-based comprehensive comparison of different network interface designs proposed by the author and the researchers at AST lab, in order to integrate shared-memory and message-passing based components on a single System on Chip; • a powerful and flexible solution to address the time closure exception issue in the design of synchronous Networks on Chip. Our solution is based on relay stations repeaters and allows to reduce the power and area demands of NoC interconnects while also reducing its buffer needs; • a solution to simplify the design of the NoC by also increasing their performance and reducing their power and area consumption. We propose to replace complex and slow virtual channel-based routers with multiple and flexible small Multi Plane ones. This solution allows us to reduce the area and power dissipation of any NoC while also increasing its performance especially when the resources are reduced. This Thesis has been written in collaboration with the Advanced System Technology laboratory in Grenoble France, and the Computer Science Department at Columbia University in the city of New York.

Towards Information-Centric Wireless Multi-hop Communication

Information-centric networking (ICN) addresses drawbacks of the Internet protocol, namely scalability and security. ICN is a promising approach for wireless communication because it enables seamless mobile communication, where intermediate or source nodes may change, as well as quick recovery from collisions. In this work, we study wireless multi-hop communication in Content-Centric Networking (CCN), which is a popular ICN architecture. We propose to use two broadcast faces that can be used in alternating order along the path to support multi-hop communication between any nodes in the network. By slightly modifying CCN, we can reduce the number of duplicate Interests by 93.4 % and the number of collisions by 61.4 %. Furthermore, we describe and evaluate different strategies for prefix registration based on overhearing. Strategies that configure prefixes only on one of the two faces can result in at least 27.3 % faster data transmissions.

Information-centric communication in mobile and wireless networks

Information-centric networking (ICN) is a new communication paradigm that has been proposed to cope with drawbacks of host-based communication protocols, namely scalability and security. In this thesis, we base our work on Named Data Networking (NDN), which is a popular ICN architecture, and investigate NDN in the context of wireless and mobile ad hoc networks. In a first part, we focus on NDN efficiency (and potential improvements) in wireless environments by investigating NDN in wireless one-hop communication, i.e., without any routing protocols. A basic requirement to initiate informationcentric communication is the knowledge of existing and available content names. Therefore, we develop three opportunistic content discovery algorithms and evaluate them in diverse scenarios for different node densities and content distributions. After content names are known, requesters can retrieve content opportunistically from any neighbor node that provides the content. However, in case of short contact times to content sources, content retrieval may be disrupted. Therefore, we develop a requester application that keeps meta information of disrupted content retrievals and enables resume operations when a new content source has been found. Besides message efficiency, we also evaluate power consumption of information-centric broadcast and unicast communication. Based on our findings, we develop two mechanisms to increase efficiency of information-centric wireless one-hop communication. The first approach called Dynamic Unicast (DU) avoids broadcast communication whenever possible since broadcast transmissions result in more duplicate Data transmissions, lower data rates and higher energy consumption on mobile nodes, which are not interested in overheard Data, compared to unicast communication. Hence, DU uses broadcast communication only until a content source has been found and then retrieves content directly via unicast from the same source. The second approach called RC-NDN targets efficiency of wireless broadcast communication by reducing the number of duplicate Data transmissions. In particular, RC-NDN is a Data encoding scheme for content sources that increases diversity in wireless broadcast transmissions such that multiple concurrent requesters can profit from each others’ (overheard) message transmissions. If requesters and content sources are not in one-hop distance to each other, requests need to be forwarded via multi-hop routing. Therefore, in a second part of this thesis, we investigate information-centric wireless multi-hop communication. First, we consider multi-hop broadcast communication in the context of rather static community networks. We introduce the concept of preferred forwarders, which relay Interest messages slightly faster than non-preferred forwarders to reduce redundant duplicate message transmissions. While this approach works well in static networks, the performance may degrade in mobile networks if preferred forwarders may regularly move away. Thus, to enable routing in mobile ad hoc networks, we extend DU for multi-hop communication. Compared to one-hop communication, multi-hop DU requires efficient path update mechanisms (since multi-hop paths may expire quickly) and new forwarding strategies to maintain NDN benefits (request aggregation and caching) such that only a few messages need to be transmitted over the entire end-to-end path even in case of multiple concurrent requesters. To perform quick retransmission in case of collisions or other transmission errors, we implement and evaluate retransmission timers from related work and compare them to CCNTimer, which is a new algorithm that enables shorter content retrieval times in information-centric wireless multi-hop communication. Yet, in case of intermittent connectivity between requesters and content sources, multi-hop routing protocols may not work because they require continuous end-to-end paths. Therefore, we present agent-based content retrieval (ACR) for delay-tolerant networks. In ACR, requester nodes can delegate content retrieval to mobile agent nodes, which move closer to content sources, can retrieve content and return it to requesters. Thus, ACR exploits the mobility of agent nodes to retrieve content from remote locations. To enable delay-tolerant communication via agents, retrieved content needs to be stored persistently such that requesters can verify its authenticity via original publisher signatures. To achieve this, we develop a persistent caching concept that maintains received popular content in repositories and deletes unpopular content if free space is required. Since our persistent caching concept can complement regular short-term caching in the content store, it can also be used for network caching to store popular delay-tolerant content at edge routers (to reduce network traffic and improve network performance) while real-time traffic can still be maintained and served from the content store.

La asunción de lo popular el teatro didáctico anarquista de Alberto Ghiraldo y su programa poético de «dar al pueblo la palabra»

Este trabajo aborda la conexión entre prácticas de comunicación y movimientos sociales a través de la particular asunción de lo popular que realizó el anarquismo en nuestro país a principios del siglo XX. Tomamos como caso particular el teatro didáctico propuesto por Alberto Ghiraldo, para describir algunas de las estrategias comunicacionales puestas en función, en relación con la cultura popular, con el fin de concientizar a las masas de los aspectos ideológicos del anarquismo.

Optimizing communication by compression for Multi-GPU Scalable Breadth-First Searches

Debido al creciente aumento del tamaño de los datos en muchos de los actuales sistemas de información, muchos de los algoritmos de recorrido de estas estructuras pierden rendimento para realizar búsquedas en estos. Debido a que la representacion de estos datos en muchos casos se realiza mediante estructuras nodo-vertice (Grafos), en el año 2009 se creó el reto Graph500. Con anterioridad, otros retos como Top500 servían para medir el rendimiento en base a la capacidad de cálculo de los sistemas, mediante tests LINPACK. En caso de Graph500 la medicion se realiza mediante la ejecución de un algoritmo de recorrido en anchura de grafos (BFS en inglés) aplicada a Grafos. El algoritmo BFS es uno de los pilares de otros muchos algoritmos utilizados en grafos como SSSP, shortest path o Betweeness centrality. Una mejora en este ayudaría a la mejora de los otros que lo utilizan. Analisis del Problema El algoritmos BFS utilizado en los sistemas de computación de alto rendimiento (HPC en ingles) es usualmente una version para sistemas distribuidos del algoritmo secuencial original. En esta versión distribuida se inicia la ejecución realizando un particionado del grafo y posteriormente cada uno de los procesadores distribuidos computará una parte y distribuirá sus resultados a los demás sistemas. Debido a que la diferencia de velocidad entre el procesamiento en cada uno de estos nodos y la transfencia de datos por la red de interconexión es muy alta (estando en desventaja la red de interconexion) han sido bastantes las aproximaciones tomadas para reducir la perdida de rendimiento al realizar transferencias. Respecto al particionado inicial del grafo, el enfoque tradicional (llamado 1D-partitioned graph en ingles) consiste en asignar a cada nodo unos vertices fijos que él procesará. Para disminuir el tráfico de datos se propuso otro particionado (2D) en el cual la distribución se haciá en base a las aristas del grafo, en vez de a los vertices. Este particionado reducía el trafico en la red en una proporcion O(NxM) a O(log(N)). Si bien han habido otros enfoques para reducir la transferecnia como: reordemaniento inicial de los vertices para añadir localidad en los nodos, o particionados dinámicos, el enfoque que se va a proponer en este trabajo va a consistir en aplicar técnicas recientes de compression de grandes sistemas de datos como Bases de datos de alto volume o motores de búsqueda en internet para comprimir los datos de las transferencias entre nodos.---ABSTRACT---The Breadth First Search (BFS) algorithm is the foundation and building block of many higher graph-based operations such as spanning trees, shortest paths and betweenness centrality. The importance of this algorithm increases each day due to it is a key requirement for many data structures which are becoming popular nowadays. These data structures turn out to be internally graph structures. When the BFS algorithm is parallelized and the data is distributed into several processors, some research shows a performance limitation introduced by the interconnection network [31]. Hence, improvements on the area of communications may benefit the global performance in this key algorithm. In this work it is presented an alternative compression mechanism. It differs with current existing methods in that it is aware of characteristics of the data which may benefit the compression. Apart from this, we will perform a other test to see how this algorithm (in a dis- tributed scenario) benefits from traditional instruction-based optimizations. Last, we will review the current supercomputing techniques and the related work being done in the area.

COMUNICAÇÃO POPULAR-ALTERNATIVA DESENVOLVIDA POR JOVENS INDÍGENAS DAS ALDEIAS DO JAGUAPIRU E BORORÓ EM DOURADOS / MS

Trata-se de um estudo de caso em que analisamos a comunicação alternativa desenvolvida pela AJI (Ação dos Jovens Indígenas), em Dourados/MS, nas aldeias do Jaguapiru e Bororó. Os jovens, que produzem audiovisuais, fotografias, blog, fotolog e um jornal impresso, encontraram na comunicação uma alternativa ante à marginalidade com que os índios são tratados na cidade, e buscarem seus direitos à voz e ao espaço social, em suas próprias tribos, já que os jovens indígenas solteiros ocupam um não-lugar na Reserva, pois não pertencem à organização tradicional indígena, tampouco estão inseridos entre os brancos. A partir das características e limitações da comunicação alternativa no Jornal AJIndo, por meio de pesquisa bibliográfica, entrevistas semi-estruturadas e análise de conteúdo, buscamos verificar o impacto da utilização desta comunicação nas aldeias para os jovens que a produzem, levando em conta interferências nas formas tradicionais de hierarquia e comunicação entre os indígenas e a função social da comunicação alternativa para eles. Embora não seja o objetivo principal do AJIndo, destaca-se o desenvolvimento da auto-estima como resultado desse processo. Soma-se a esta função, a mobilização por transformação social e a formação crítico-educativa. Após o esforço de organização, os jovens começaram a se sentir pertencentes aos indígenas e a serem ouvidos pelos brancos, mesmo que acreditem ser por interesses políticos da comunidade como um todo.

COMUNICAÇÃO POPULAR-ALTERNATIVA DESENVOLVIDA POR JOVENS INDÍGENAS DAS ALDEIAS DO JAGUAPIRU E BORORÓ EM DOURADOS / MS

Trata-se de um estudo de caso em que analisamos a comunicação alternativa desenvolvida pela AJI (Ação dos Jovens Indígenas), em Dourados/MS, nas aldeias do Jaguapiru e Bororó. Os jovens, que produzem audiovisuais, fotografias, blog, fotolog e um jornal impresso, encontraram na comunicação uma alternativa ante à marginalidade com que os índios são tratados na cidade, e buscarem seus direitos à voz e ao espaço social, em suas próprias tribos, já que os jovens indígenas solteiros ocupam um não-lugar na Reserva, pois não pertencem à organização tradicional indígena, tampouco estão inseridos entre os brancos. A partir das características e limitações da comunicação alternativa no Jornal AJIndo, por meio de pesquisa bibliográfica, entrevistas semi-estruturadas e análise de conteúdo, buscamos verificar o impacto da utilização desta comunicação nas aldeias para os jovens que a produzem, levando em conta interferências nas formas tradicionais de hierarquia e comunicação entre os indígenas e a função social da comunicação alternativa para eles. Embora não seja o objetivo principal do AJIndo, destaca-se o desenvolvimento da auto-estima como resultado desse processo. Soma-se a esta função, a mobilização por transformação social e a formação crítico-educativa. Após o esforço de organização, os jovens começaram a se sentir pertencentes aos indígenas e a serem ouvidos pelos brancos, mesmo que acreditem ser por interesses políticos da comunidade como um todo.

Wireless age; an illustrated monthly magazine of radio communication.

Mode of access: Internet.

Threatening Messages in Climate Change Communication

Thesis (Ph.D.)--University of Washington, 2016-06