Abstract: Social media has become an important source of information for the public and the media profession. Some social issues raised on social media are picked up by journalists to report on other platforms. This relationship between social media and mainstream media can sometimes drive public debate or stimulate social movements. The question to examine is in what situations can social media conversations raise awareness and stimulate change on public issues. This study addresses the communication patterns of social media conversations driving covert issues into mainstream media and leading to social advocacy movements. In methodological terms, the study findings are based on a content analysis of Facebook, Twitter, news websites and television media reports on three different case studies – saving Bryde’s whale, protests against a government proposal to downsize the Office of Knowledge Management and Development in Thailand, and a dengue fever campaign. These case studies were chosen because they represent issues that most members of the public do not pay much attention to but social media conversations stimulated public debate and calls to action. This study found: 1) Collective social media conversations can stimulate public debate and encourage change at three levels – awareness, public debate, and action of policy and social change. The level depends on the communication patterns of online users and media coverage. 2) Patterns of communication have to be designed to combine social media conversations, online opinion leaders, mainstream media coverage and call to both online and offline action to motivate social change. Thus, this result suggests that social media is a powerful platform for collective communication and setting the agenda on public issues for mainstream media. However, for social change to succeed, social media should be used to mobilize online movements to move offline too.
Abstract: All-to-all personalized communication, also known as complete exchange, is one of the most dense communication patterns in parallel computing. In this paper, we propose new indirect algorithms for complete exchange on all-port ring and torus. The new algorithms fully utilize all communication links and transmit messages along shortest paths to completely achieve the theoretical lower bounds on message transmission, which have not be achieved among other existing indirect algorithms. For 2D r × c ( r % c ) all-port torus, the algorithm has time complexities of optimal transmission cost and O(c) message startup cost. In addition, the proposed algorithms accommodate non-power-of-two tori where the number of nodes in each dimension needs not be power-of-two or square. Finally, the algorithms are conceptually simple and symmetrical for every message and every node so that they can be easily implemented and achieve the optimum in practice.