The digital social network of a user, who had undergone two radical locational changes, was analyzed to assess if digital social networks were influencing the ability of the user to create new physical social bonds in...The digital social network of a user, who had undergone two radical locational changes, was analyzed to assess if digital social networks were influencing the ability of the user to create new physical social bonds in regards to proximal distance of existing social interactions and if new physical social networks conformed to Dunbar’s theorem of the social network size limit. The social network data (users equating to nodes and physical friendships to links) was implemented into the network analysis software “Gephi”. Standard network measures were assessed on the three digital sub-networks with the user removed from the calculations. Two separation algorithms were assessed on the network data, the Force Atlas algorithm and the Fruchterman Reingold algorithm. The results contradicted with existing research indicating that existing digital social networks did not have an effect on the creation of new social bonds after a radical locational change. The creation of new physical social networks conformed in part to Dunbar’s network size limit theorem and existing social links did not affect the user’s ability to create new social partnerships.展开更多
We briefly survey a number of important recent uchievements in Theoretical Computer Science （TCS）, especially Computational Complexity Theory. We will discuss the PCP Theorem, its implications to inapproximability o...We briefly survey a number of important recent uchievements in Theoretical Computer Science （TCS）, especially Computational Complexity Theory. We will discuss the PCP Theorem, its implications to inapproximability on combinatorial optimization problems; space bounded computations, especially deterministic logspace algorithm for undirected graph connectivity problem; deterministic polynomial-time primality test; lattice complexity, worst-case to average-case reductions; pseudorandomness and extractor constructions; and Valiant＇s new theory of holographic algorithms and reductions.展开更多
文摘The digital social network of a user, who had undergone two radical locational changes, was analyzed to assess if digital social networks were influencing the ability of the user to create new physical social bonds in regards to proximal distance of existing social interactions and if new physical social networks conformed to Dunbar’s theorem of the social network size limit. The social network data (users equating to nodes and physical friendships to links) was implemented into the network analysis software “Gephi”. Standard network measures were assessed on the three digital sub-networks with the user removed from the calculations. Two separation algorithms were assessed on the network data, the Force Atlas algorithm and the Fruchterman Reingold algorithm. The results contradicted with existing research indicating that existing digital social networks did not have an effect on the creation of new social bonds after a radical locational change. The creation of new physical social networks conformed in part to Dunbar’s network size limit theorem and existing social links did not affect the user’s ability to create new social partnerships.
文摘We briefly survey a number of important recent uchievements in Theoretical Computer Science （TCS）, especially Computational Complexity Theory. We will discuss the PCP Theorem, its implications to inapproximability on combinatorial optimization problems; space bounded computations, especially deterministic logspace algorithm for undirected graph connectivity problem; deterministic polynomial-time primality test; lattice complexity, worst-case to average-case reductions; pseudorandomness and extractor constructions; and Valiant＇s new theory of holographic algorithms and reductions.
