scholarly journals The Spread of Ideas in a Network—The Garbage-Can Model

Entropy ◽  
2021 ◽  
Vol 23 (10) ◽  
pp. 1345
Author(s):  
Dorota Żuchowska-Skiba ◽  
Maria Stojkow ◽  
Malgorzata J. Krawczyk ◽  
Krzysztof Kułakowski
Keyword(s):  
Social Networks ◽  
Bounded Rationality ◽  
Chain Length ◽  
Hamming Distance ◽  
Cooperative Behavior ◽  
Threshold Value ◽  
Temporal Networks ◽  
Garbage Can Model ◽  
The Third ◽  
Organizational Choice

The main goal of our work is to show how ideas change in social networks. Our analysis is based on three concepts: (i) temporal networks, (ii) the Axelrod model of culture dissemination, (iii) the garbage can model of organizational choice. The use of the concept of temporal networks allows us to show the dynamics of ideas spreading processes in networks, thanks to the analysis of contacts between agents in networks. The Axelrod culture dissemination model allows us to use the importance of cooperative behavior for the dynamics of ideas disseminated in networks. In the third model decisions on solutions of problems are made as an outcome of sequences of pseudorandom numbers. The origin of this model is the Herbert Simon’s view on bounded rationality. In the Axelrod model, ideas are conveyed by strings of symbols. The outcome of the model should be the diversity of evolving ideas as dependent on the chain length, on the number of possible values of symbols and on the threshold value of Hamming distance which enables the combination.

Optimising influence in social networks using bounded rationality models

2016 ◽  
Vol 6 (1) ◽  
Author(s):  
Dharshana Kasthurirathna ◽  
Michael Harrè ◽  
Mahendra Piraveenan
Keyword(s):  
Social Networks ◽  
Bounded Rationality

A Usability Evaluation of Facebook's Privacy Features Based on the Perspectives of Experts and Users

2019 ◽  
pp. 1544-1568
Author(s):  
Márcio J. Mantau ◽  
Marcos H. Kimura ◽  
Isabela Gasparini ◽  
Carla D. M. Berkenbrock ◽  
Avanilde Kemczinski
Keyword(s):  
Social Networks ◽  
Social Media ◽  
Social Network ◽  
User Interaction ◽  
Usability Evaluation ◽  
Second Step ◽  
Web Based ◽  
The Third ◽  
Privacy Settings ◽  
Three Stages

The issue of privacy in social networks is a hot topic today, because of the growing amount of information shared among users, who are connected to social media every moment and by different devices and displays. This chapter presents a usability evaluation of the privacy features of Facebook's social network. The authors carry out an evaluation composed by three approaches, executed in three stages: first by the analysis and inspection of system's features related to privacy, available for both systems (Web-based systems and mobile-based systems, e.g. app). The second step is a heuristic evaluation led by three experts, and finally, the third step is a questionnaire with 605 users to compare the results between specialists and real users. This chapter aims to present the problems associated with these privacy settings, and it also wants to contribute for improving the user interaction with this social network.

Content Delivery Networks

2021 ◽  
pp. 66-95
Author(s):  
Yannick Le Louédec ◽  
Gaëlle Yven ◽  
Valéry Bastide ◽  
Yiping Chen ◽  
Gwenaëlle Delsart ◽  
...  
Keyword(s):  
Social Networks ◽  
Content Delivery ◽  
Media Content ◽  
Future Perspectives ◽  
Fully Integrated ◽  
Web Performance ◽  
Content Delivery Networks ◽  
The Third ◽  
The Status ◽  
Delivery Networks

This chapter provides an overview on the recent advances and perspectives on content delivery networks (CDNs). After a reminder on the definition and core features of CDNs, the first section highlights their importance with quantitative illustrations. The second section identifies the various types of CDNs which have been deployed to address different markets. The growth of the CDNs has been driven primarily by video streaming. Next to media content, CDNs have evolved to deliver always more demanding social networks and applications. Security solutions are now fully integrated into CDNs and marketed as flagship products. The third, fourth, and fifth sections outline the challenges and technical evolutions of the CDNs to keep up with their customers' hunger for media content, web performance, and security. The sixth section focuses on the convergence of CDNs and clouds. The seventh section reviews the status and perspectives of different approaches for using multiple CDNs. The last section presents the current positioning and future perspectives of the CDNs in the mobile domain.

scholarly journals Recurrence Networks in Natural Languages

Entropy ◽  
2019 ◽  
Vol 21 (5) ◽  
pp. 517
Author(s):  
Edgar Baeza-Blancas ◽  
Bibiana Obregón-Quintana ◽  
Candelario Hernández-Gómez ◽  
Domingo Gómez-Meléndez ◽  
Daniel Aguilar-Velázquez ◽  
...  
Keyword(s):  
Hamming Distance ◽  
Threshold Value ◽  
Network Density ◽  
Natural Languages ◽  
Linear Discriminant ◽  
Word Structure ◽  
European Languages ◽  
Written Texts ◽  
Linguistic Family ◽  
Network Metrics

We present a study of natural language using the recurrence network method. In our approach, the repetition of patterns of characters is evaluated without considering the word structure in written texts from different natural languages. Our dataset comprises 85 ebookseBooks written in 17 different European languages. The similarity between patterns of length m is determined by the Hamming distance and a value r is considered to define a matching between two patterns, i.e., a repetition is defined if the Hamming distance is equal or less than the given threshold value r. In this way, we calculate the adjacency matrix, where a connection between two nodes exists when a matching occurs. Next, the recurrence network is constructed for the texts and some representative network metrics are calculated. Our results show that average values of network density, clustering, and assortativity are larger than their corresponding shuffled versions, while for metrics like such as closeness, both original and random sequences exhibit similar values. Moreover, our calculations show similar average values for density among languages which that belong to the same linguistic family. In addition, the application of a linear discriminant analysis leads to well-separated clusters of family languages based on based on the network-density properties. Finally, we discuss our results in the context of the general characteristics of written texts.

Summation of Contrast in Perceived Form from Texture

Perception ◽  
1997 ◽  
Vol 26 (1_suppl) ◽  
pp. 224-224
Author(s):  
P I Laurinen ◽  
L A Olzak
Keyword(s):  
Threshold Value ◽  
Sinusoidal Grating ◽  
Vertical Orientation ◽  
Similar Frequency ◽  
The Third ◽  
Wide Range ◽  
Relative Contrast ◽  
Narrow Frequency Band ◽  
Spatial Grain ◽  
Contrast Discrimination

The relative contrast of two superimposed triangles formed by truncated sinusoidal gratings determines which appears more salient. We have previously reported that the saliency of one triangle is selectively enhanced by superimposing a third grating of similar frequency but different orientation. We now ask how the contrasts of the three gratings combine to determine saliency. Stimuli were two superimposed isosceles triangles, formed by overlaying sharply truncated patches of a sinusoidal grating, one at 1.5 cycles deg−1 tilted +45°, the other at 6 cycles deg−1, tilted −45° from vertical. The sharpest-angle apexes pointed in opposite directions (left or right). Contrasts of the gratings were initially adjusted to yield equal performance when observers chose whether the more salient target pointed left or right following a brief (400 ms) monocular exposure. In each test condition a third grating of vertical orientation (spatial frequency 1.5, 3, or 6 cycles deg−1) was added to the entire stimulus at one of six contrast levels ranging from near threshold to 10 × threshold. The point of equal saliency was re-determined from psychometric functions by varying the contrast of one triangle in a 2AFC staircase procedure. The saliency of each triangle was enhanced when the third grating was matched in frequency, but no effect occurred when the third grating differed by an octave (eg was 3 cycles deg−1). Beyond some threshold value of the third grating contrast, the contrast needed to reinstate equal salience was found to be inversely proportional to the contrast of the third grating. Our results are in agreement with the characteristics of higher-level mechanisms that mediate spatial-grain and/or pattern contrast discrimination, and suggest that form-from-texture mechanisms sum component contrasts linearly over a wide range of orientations within a narrow frequency band.

RANKING DEVELOPER CANDIDATES BY SOCIAL LINKS

2014 ◽  
Vol 17 (07n08) ◽  
pp. 1550005 ◽  
Author(s):  
QI XUAN ◽  
CHENBO FU ◽  
LI YU
Keyword(s):  
Social Networks ◽  
Open Source ◽  
Open Source Software ◽  
Performance Indicators ◽  
Temporal Networks ◽  
Successful Operation ◽  
Weighted Networks ◽  
Ranking Algorithms ◽  
The Future ◽  
Better Than

In open source software (OSS) projects, participants initially communicate with others and then may become developers if they are deemed worthy by the community. Recent studies indicate that the abundance of established social links of a participant is the strongest predictor to his/her promotion. Having reliable rankings of the candidates is key to recruiting and maintaining a successful operation of an OSS project. This paper adopts degree-based, PageRank, and Hits ranking algorithms to rank developer candidates in OSS projects based on their social links. We construct several types of social networks based on the communications between the participants in Apache OSS projects, then train and test the ranking algorithms in these networks. We find that, for all the ranking algorithms under study, the rankings of emergent developers in temporal networks are higher than those in cumulative ones, indicating that the more recent communications of a developer in a project are more important to predict his/her first commit in the project. By comparison, the simple degree-based and the PageRank ranking algorithms in temporal undirected weighted networks behave better than the others in identifying emergent developers based on four performance indicators, and are thus recommended to be applied in the future.

Sign in / Sign up

Export Citation Format

Share Document