Dynamical Networks of Social Influence: Modern Trends and Perspectives

Dynamics and control of processes over social networks, such as the evolution of opinions, social influence and interpersonal appraisals, diffusion of information and misinformation, emergence and dissociation of communities, are now attracting significant attention from the broad research community that works on systems, control, identification and learning. To provide an introduction to this rapidly developing area, a Tutorial Session was included into the program of IFAC World Congress 2020. This paper provides a brief summary of the three tutorial lectures, covering the most “mature” directions in analysis of social networks and dynamics over them: 1) formation of opinions under social influence; 2) identification and learning for analysis of a network’s structure; 3) dynamics of interpersonal appraisals

Use and perceptions of second life by distance learners: comparison with other communication media

Research has demonstrated that the use of communication media in distance education can reduce the feeling of distance and isolation from peers and tutor, and provide opportunities for collaborative learning activities (Bates, 2005). The use of virtual worlds (VW) in education has increased in recent years, with Second Life (SL) being the most commonly used VW in higher education (Wang & Burton, 2012). There is a paucity of information available on students’ use and perceptions of SL in relation to other online communication media available to the distance learner. Consequently, in the study described here, this area was explored with a group of students registered in a part-time distance education Master’s program at a large UK University open to international students. A self-completion survey was designed to assess students’ use and perceptions of using SL compared with other communication media. The majority of students rated SL lower than other forms of communications media such as email, WebCT discussion boards, Skype, and Wimba for facilitating communication, promoting the formation of social networks, fostering a sense of community, and benefiting their learning.  It is possible that the results of this study were influenced by the lower frequency of use of SL in this program compared to other work reported on this subject. Further work is required to evaluate the effect of frequency of use of SL and availability of alternative communication media on students’ use and perceptions of this virtual world

Game Theory Meets Network Security: A Tutorial at ACM CCS

The increasingly pervasive connectivity of today's information systems brings up new challenges to security. Traditional security has accomplished a long way toward protecting well-defined goals such as confidentiality, integrity, availability, and authenticity. However, with the growing sophistication of the attacks and the complexity of the system, the protection using traditional methods could be cost-prohibitive. A new perspective and a new theoretical foundation are needed to understand security from a strategic and decision-making perspective. Game theory provides a natural framework to capture the adversarial and defensive interactions between an attacker and a defender. It provides a quantitative assessment of security, prediction of security outcomes, and a mechanism design tool that can enable security-by-design and reverse the attacker's advantage. This tutorial provides an overview of diverse methodologies from game theory that includes games of incomplete information, dynamic games, mechanism design theory to offer a modern theoretic underpinning of a science of cybersecurity. The tutorial will also discuss open problems and research challenges that the CCS community can address and contribute with an objective to build a multidisciplinary bridge between cybersecurity, economics, game and decision theory

A Tutorial on Clique Problems in Communications and Signal Processing

Since its first use by Euler on the problem of the seven bridges of K\"onigsberg, graph theory has shown excellent abilities in solving and unveiling the properties of multiple discrete optimization problems. The study of the structure of some integer programs reveals equivalence with graph theory problems making a large body of the literature readily available for solving and characterizing the complexity of these problems. This tutorial presents a framework for utilizing a particular graph theory problem, known as the clique problem, for solving communications and signal processing problems. In particular, the paper aims to illustrate the structural properties of integer programs that can be formulated as clique problems through multiple examples in communications and signal processing. To that end, the first part of the tutorial provides various optimal and heuristic solutions for the maximum clique, maximum weight clique, and $k$-clique problems. The tutorial, further, illustrates the use of the clique formulation through numerous contemporary examples in communications and signal processing, mainly in maximum access for non-orthogonal multiple access networks, throughput maximization using index and instantly decodable network coding, collision-free radio frequency identification networks, and resource allocation in cloud-radio access networks. Finally, the tutorial sheds light on the recent advances of such applications, and provides technical insights on ways of dealing with mixed discrete-continuous optimization problems