Search

The Semantic Link Network is a general semantic model for modeling the structure and the evolution of complex systems. Various semantic links play different roles in rendering the semantics of complex system. One of the basic semantic links represents cause-effect relation, which plays an important role in representation and understanding. This paper verifies the role of the Semantic Link Network in representing the core of text by investigating the contribution of cause-effect link to representing the core of scientific papers. Research carries out with the following steps: (1) Two propositions on the contribution of cause-effect link in rendering the core of paper are proposed and verified through a statistical survey, which shows that the sentences on cause-effect links cover about 65% of key words within each paper on average. (2) An algorithm based on syntactic patterns is designed for automatically extracting cause-effect link from scientific papers, which recalls about 70% of manually annotated cause-effect links on average, indicating that the result adapts to the scale of data sets. (3) The effects of cause-effect link on four schemes of incorporating cause-effect link into the existing instances of the Semantic Link Network for enhancing the summarization of scientific papers are investigated. The experiments show that the quality of the summaries is significantly improved, which verifies the role of semantic links. The significance of this research lies in two aspects: (1) it verifies that the Semantic Link Network connects the important concepts to render the core of text; and, (2) it provides an evidence for realizing content services such as summarization, recommendation and question answering based on the Semantic Link Network, and it can inspire relevant research on content computing. [ABSTRACT FROM AUTHOR]

This paper uses text data mining to identify long-term developments in tourism academic research from the perspectives of thematic focus, geography, and gender of tourism authorship. Abstracts of papers published in the period of 1970–2017 in high-ranking tourist journals were extracted from the Scopus database and served as data source for the analysis. Fourteen subject areas were identified using the Latent Dirichlet Allocation (LDA) text mining approach. LDA integrated with GIS information allowed to obtain geography distribution and trends of scholarly output, while probabilistic methods of gender identification based on social network data mining were used to track gender dynamics with sufficient confidence. The findings indicate that, while all 14 topics have been prominent from the inception of tourism studies to the present day, the geography of scholarship has notably expanded and the share of female authorship has increased through time and currently almost equals that of male authorship. [ABSTRACT FROM AUTHOR]

Public transport (PT) is a key element in most major cities around the world. With the development of smartphones, available journey planning information is becoming an integral part of the PT system. Each traveler has specific preferences when undertaking a trip, and these preferences can also be reflected on the smartphone. This paper considers transit assignment in urban public-transport networks in which the passengers receive smartphone-based information containing elements that might influence the travel decisions in relation to line loads, as well as passenger benefits, and the paper discusses the transition from the current widespread choosing approach to a personalized decision-making approach based on smartphone information. The approach associated with smartphone guidance that considers passengers’ preference on travel time, waiting time and transfer is proposed in the process of obtaining his/her preferred route from the potential travel routes generated by the Deep First Search (DFS) method. Two other approaches, based on the scenarios reflecting reality, include passengers with access to no real time information, and passengers that only have access to the arrival time at the platform are used as comparisons. For illustration, the same network proposed by Spiess and Florian is utilized on the experiments in an agent-based model. Two experiments are conducted respectively according to whether each passenger’s choosing method is consistent. As expected, the results in the first experiment showed that the travel for consistent passengers with smartphone guidance was clearly shorter and that it can reduce travel time exceeding 15% and weighted cost exceeding 20%, and the average saved time approximated 3.88 minutes per passenger. The second experiment presented that travel cost, as well as cost savings, gradually decreased by employing smartphone guidance, and the maximum cost savings accounted for 14.2% of the total weighted cost. [ABSTRACT FROM AUTHOR]

This paper aims to optimize a desirable fare structure for the public transit service along a bus-subway corridor with the consideration of those factors related to equity in trip, including travel distance and comfort level. The travel distance factor is represented by the distance-based fare strategy, which is an existing differential strategy. The comfort level one is considered in the area-based fare strategy which is a new differential strategy defined in this paper. Both factors are referred to by the combined fare strategy which is composed of distance-based and area-based fare strategies. The flat fare strategy is applied to determine a reference level of social welfare and obtain the general passenger flow along transit lines, which is used to divide areas or zones along the corridor. This problem is formulated as a bi-level program, of which the upper level maximizes the social welfare and the lower level capturing traveler choice behavior is a variable-demand stochastic user equilibrium assignment model. A genetic algorithm is applied to solve the bi-level program while the method of successive averages is adopted to solve the lower-level model. A series of numerical experiments are carried out to illustrate the performance of the models and solution methods. Numerical results indicate that all three differential fare strategies play a better role in enhancing the social welfare than the flat fare strategy and that the fare structure under the combined fare strategy generates the highest social welfare and the largest resulting passenger demand, which implies that the more equity factors a differential fare strategy involves the more desirable fare structure the strategy has. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new approach for learning node embeddings for weighted undirected networks. We perform a random walk on the network to extract the latent structural information and perform node embedding learning under a similarity-based framework. Unlike previous works, we apply a different criterion to capture the proximity information between nodes in a network, and use it for improved modeling of similarities between nodes. We show that the mean commute time (MCT) between two nodes, defined as the average time a random walker takes to reach a target node and return to the source, plays a crucial role in quantifying the actual degree of proximity between two nodes of the network. We then introduce a novel definition of a similarity matrix that is based on the pair-wise mean commute time captured, which enables us to adequately represent the connection of similar nodes. We utilize pseudoinverse of the Laplacian matrix of the graph for calculating such a proximity measure, capturing rich structural information out of the graph for learning more adequate node representations of a network. The results of different experiments on three real-world networks demonstrate that our proposed method outperforms existing related efforts in classification, clustering, visualization as well as link prediction tasks. [ABSTRACT FROM AUTHOR]

The popularity of online information generally experiences a rising and falling evolution. This paper considers the “burst”, “peak”, and “fade” key events together as a representative summary of popularity evolution. We propose a novel prediction task—predicting when popularity undergoes these key events. It is of great importance to know when these three key events occur, because doing so helps recommendation systems, online marketing, and containment of rumors. However, it is very challenging to solve this new prediction task due to two issues. First, popularity evolution has high variation and can follow various patterns, so how can we identify “burst”, “peak”, and “fade” in different patterns of popularity evolution? Second, these events usually occur in a very short time, so how can we accurately yet promptly predict them? In this paper we address these two issues. To handle the first one, we use a simple moving average to smooth variation, and then a universal method is presented for different patterns to identify the key events in popularity evolution. To deal with the second one, we extract different types of features that may have an impact on the key events, and then a correlation analysis is conducted in the feature selection step to remove irrelevant and redundant features. The remaining features are used to train a machine learning model. The feature selection step improves prediction accuracy, and in order to emphasize prediction promptness, we design a new evaluation metric which considers both accuracy and promptness to evaluate our prediction task. Experimental and comparative results show the superiority of our prediction solution. [ABSTRACT FROM AUTHOR]

Creativity is a complex, multi-faceted concept encompassing a variety of related aspects, abilities, properties and behaviours. If we wish to study creativity scientifically, then a tractable and well-articulated model of creativity is required. Such a model would be of great value to researchers investigating the nature of creativity and in particular, those concerned with the evaluation of creative practice. This paper describes a unique approach to developing a suitable model of how creative behaviour emerges that is based on the words people use to describe the concept. Using techniques from the field of statistical natural language processing, we identify a collection of fourteen key components of creativity through an analysis of a corpus of academic papers on the topic. Words are identified which appear significantly often in connection with discussions of the concept. Using a measure of lexical similarity to help cluster these words, a number of distinct themes emerge, which collectively contribute to a comprehensive and multi-perspective model of creativity. The components provide an ontology of creativity: a set of building blocks which can be used to model creative practice in a variety of domains. The components have been employed in two case studies to evaluate the creativity of computational systems and have proven useful in articulating achievements of this work and directions for further research. [ABSTRACT FROM AUTHOR]

The user interaction in online social networks can not only reveal the social relationships among users in e-commerce systems, but also imply the social preferences of a target user for recommendation services. However, the current research has rarely explored the impact of social interaction on recommendation performance, especially now that recommender systems face increasing challenges and suffer from poor efficiency due to social data overload. Therefore, applied research on user interaction has become increasingly necessary in the field of social recommendation. In this paper, we develop a novel social recommendation method based on the user interaction in complex social networks, called the SRUI model, to present a basis for improving the efficiency of the recommender systems. Specifically, a weighted social interaction network is first mapped to represent the interactions among social users according to the gathered information about historical user behavior. Thereafter, the complete path set is mined by the complete path mining (CPM) algorithm to find social similar neighbors with tastes similar to those of the target user. Finally, the social similar tendencies of the users on the complete paths are obtained to predict the final ratings of items through the SRUI model. A series of experimental results based on two real public datasets show that our approach performs better than other state-of-the-art methods in terms of recommendation performance. [ABSTRACT FROM AUTHOR]

Orienteering problem (OP) is a routing problem, where the aim is to generate a path through set of nodes, which would maximize total score and would not exceed the budget. In this paper, we present an extension of classic OP—Orienteering Problem with Functional Profits (OPFP), where the score of a specific point depends on its characteristics, position in the route, and other points in the route. For solving OPFP, we developed an open-source framework for solving orienteering problems, which utilizes four core components of OP in its modular architecture. Fully-written in Go programming language our framework can be extended for solving different types of tasks with different algorithms; this was demonstrated by implementation of two popular algorithms for OP solving—Ant Colony Optimization and Recursive Greedy Algorithm. Computational efficiency of the framework was shown through solving four well-known OP types: classic Orienteering Problem (OP), Orienteering Problem with Compulsory Vertices (OPCV), Orienteering Problem with Time Windows (OPTW), and Time Dependent Orienteering Problem (TDOP) along with OPFP. Experiments were conducted on a large multi-source dataset for Saint Petersburg, Russia, containing data from Instagram, TripAdvisor, Foursquare and official touristic website. Our framework is able to construct touristic paths for different OP types within few seconds using dataset with thousands of points of interest. [ABSTRACT FROM AUTHOR]

Information about a person’s income can be useful in several business-related contexts, such as personalized advertising or salary negotiations. However, many people consider this information private and are reluctant to share it. In this paper, we show that income is predictable from the digital footprints people leave on Facebook. Applying an established machine learning method to an income-representative sample of 2,623 U.S. Americans, we found that (i) Facebook Likes and Status Updates alone predicted a person’s income with an accuracy of up to r = 0.43, and (ii) Facebook Likes and Status Updates added incremental predictive power above and beyond a range of socio-demographic variables (ΔR2 = 6–16%, with a correlation of up to r = 0.49). Our findings highlight both opportunities for businesses and legitimate privacy concerns that such prediction models pose to individuals and society when applied without individual consent. [ABSTRACT FROM AUTHOR]

Given a real-world graph, how can we measure relevance scores for ranking and link prediction? Random walk with restart (RWR) provides an excellent measure for this and has been applied to various applications such as friend recommendation, community detection, anomaly detection, etc. However, RWR suffers from two problems: 1) using the same restart probability for all the nodes limits the expressiveness of random walk, and 2) the restart probability needs to be manually chosen for each application without theoretical justification. We have two main contributions in this paper. First, we propose R W E R (RWER), a random walk based measure which improves the expressiveness of random walks by using a distinct restart probability for each node. The improved expressiveness leads to superior accuracy for ranking and link prediction. Second, we propose SR (pervised start for RWER), an algorithm for learning the restart probabilities of RWER from a given graph. SR eliminates the need to heuristically and manually select the restart parameter for RWER. Extensive experiments show that our proposed method provides the best performance for ranking and link prediction tasks. [ABSTRACT FROM AUTHOR]

Temperament and Psychological Types can be defined as innate psychological characteristics associated with how we relate with the world, and often influence our study and career choices. Furthermore, understanding these features help us manage conflicts, develop leadership, improve teaching and many other skills. Assigning temperament and psychological types is usually made by filling specific questionnaires. However, it is possible to identify temperamental characteristics from a linguistic and behavioral analysis of social media data from a user. Thus, machine-learning algorithms can be used to learn from a user’s social media data and infer his/her behavioral type. This paper initially provides a brief historical review of theories on temperament and then brings a survey of research aimed at predicting temperament and psychological types from social media data. It follows with the proposal of a framework to predict temperament and psychological types from a linguistic and behavioral analysis of Twitter data. The proposed framework infers temperament types following the David Keirsey’s model, and psychological types based on the MBTI model. Various data modelling and classifiers are used. The results showed that Random Forests with the LIWC technique can predict with 96.46% of accuracy the Artisan temperament, 92.19% the Guardian temperament, 78.68% the Idealist, and 83.82% the Rational temperament. The MBTI results also showed that Random Forests achieved a better performance with an accuracy of 82.05% for the E/I pair, 88.38% for the S/N pair, 80.57% for the T/F pair, and 78.26% for the J/P pair. [ABSTRACT FROM AUTHOR]

A recurrent criticism concerning the use of online social media data in political science research is the lack of demographic information about social media users. By employing a face-recognition algorithm to the profile pictures of Facebook users, the paper derives two fundamental demographic characteristics (age and gender) of a sample of Facebook users who interacted with the most relevant British parties in the two weeks before the Brexit referendum of 23 June 2016. The article achieves the goals of (i) testing the precision of the algorithm, (ii) testing its validity, (iii) inferring new evidence on digital mobilisation, and (iv) tracing the path for future developments and application of the algorithm. The findings show that the algorithm is reliable and that it can be fruitfully used in political and social sciences both to confirm the validity of survey data and to obtain information from populations that are generally unavailable within traditional surveys. [ABSTRACT FROM AUTHOR]

We propose an agent-based model leading to a decrease or an increase of hostility between agents after a major cultural threat such as a terrorist attack. The model is inspired from the Terror Management Theory and the Social Judgement Theory. An agent has a cultural identity defined through its acceptance segments about each of three different cultural worldviews (i.e., Atheist, Muslim, Christian) of the considered society. An agent’s acceptance segment is composed from its acceptable positions toward a cultural worldview, including its most acceptable position. An agent forms an attitude about another agent depending on the similarity between their cultural identities. When a terrorist attack is perpetrated in the name of an extreme cultural identity, the negatively perceived agents from this extreme cultural identity point of view tend to decrease the width of their acceptance segments in order to differentiate themselves more from the threatening cultural identity. We generated a set of populations with cultural identities compatible with data from a survey on attitudes among a large sample representative of the population of France; we then simulated the reaction of these agents facing a terrorist attack from Muslim extremists. For most populations, the average attitude toward Muslims becomes more negative. However, for some specific populations, we noticed the opposite effect as the average attitude of the population toward Muslims becomes less negative. In these populations, the Muslim agents strongly differentiate themselves from the terrorists’ extreme cultural identity, and the other agents are aware of these changes. These reactions are due to particular properties of their cultural identities that are identified in this paper. [ABSTRACT FROM AUTHOR]

The modelling of deceptions in game theory and decision theory has not been well studied, despite the increasing importance of this problem in social media, public discourse, and organisational management. This paper presents an improved formulation of the extant information-theoretic models of deceptions, a framework for incorporating these models of deception into game and decision theoretic models of deception, and applies these models and this framework in an agent based evolutionary simulation that models two very common deception types employed in “fake news” attacks. The simulation results for both deception types modelled show, as observed empirically in many social systems subjected to “fake news” attacks, that even a very small population of deceivers that transiently invades a much larger population of non-deceiving agents can strongly alter the equilibrium behaviour of the population in favour of agents playing an always defect strategy. The results also show that the ability of a population of deceivers to establish itself or remain present in a population is highly sensitive to the cost of the deception, as this cost reduces the fitness of deceiving agents when competing against non-deceiving agents. Diffusion behaviours observed for agents exploiting the deception producing false beliefs are very close to empirically observed behaviours in social media, when fitted to epidemiological models. We thus demonstrate, using the improved formulation of the information-theoretic models of deception, that agent based evolutionary simulations employing the Iterated Prisoner’s Dilemma can accurately capture the behaviours of a population subject to deception attacks introducing uncertainty and false perceptions, and show that information-theoretic models of deception have practical applications beyond trivial taxonomical analysis. [ABSTRACT FROM AUTHOR]

We introduce a new agent-based model of opinion dynamics in which binary opinions of each agent can be measured and described regarding both pre- and post-influence at both of two levels, public and private, vis-à-vis the influence source. The model combines ideas introduced within the q-voter model with noise, proposed by physicists, with the descriptive, four-dimensional model of social response, formulated by social psychologists. We investigate two versions of the same model that differ only by the updating order: an opinion on the public level is updated before an opinion on the private level or vice versa. We show how the results on the macroscopic scale depend on this order. The main finding of this paper is that both models produce the same outcome if one looks only at such a macroscopic variable as the total number of the individuals with positive opinions. However, if also the level of internal harmony (viz., dissonance) is measured, then significant, qualitative differences are seen between these two versions of the model. All results were obtained simultaneously within Monte Carlo simulations and analytical calculations. We discuss the importance of our studies and findings from three points of view: the theory of phase transitions, agent-based modeling of social systems, and social psychology. [ABSTRACT FROM AUTHOR]

The accuracy and diversity of recommendation algorithms have always been the research hotspot of recommender systems. A good recommender system should not only have high accuracy and diversity, but also have adequate robustness against spammer attacks. However, the issue of recommendation robustness has received relatively little attention in the literature. In this paper, we systematically study the influences of different spammer behaviors on the recommendation results in various recommendation algorithms. We further propose an improved algorithm by incorporating the inner-similarity of user’s purchased items in the classic KNN approach. The new algorithm effectively enhances the robustness against spammer attacks and thus outperforms traditional algorithms in recommendation accuracy and diversity when spammers exist in the online commercial systems. [ABSTRACT FROM AUTHOR]

This paper examines social class-based differences in influence in online review contexts. We explore four mechanisms for how a review writer’s social class may affect readers’ evaluations of the organization. First, we argue that, via a “contagion” process, organizations reviewed by higher-class individuals will be evaluated more positively than organizations reviewed by lower-class individuals. Second, we expect that higher-class reviewers will be seen as more knowledgeable; thus, their opinions will be more influential in shaping others’ opinions. Third, we expect that reviewers will be seen more influential when they review organizations that match their social class. Fourth, we expect people to be more influenced by those who share their own class background. A large-scale observational study of reviews (N = 1,234,665) from finds support for the contagion, the organization-reviewer social class matching, and the reviewer-participant social matching hypotheses, but disconfirms the hypothesis that higher-class reviewers are always treated as having more expertise. Two experimental studies (N = 354 and N = 638) demonstrate that reviewer class plays a causal role in both a contagion process and in an assumption of higher-class knowledge process, but do not provide evidence for the reviewer-participant social matching hypothesis. [ABSTRACT FROM AUTHOR]

Wireless Mesh Networks (WMNs) integrate the advantages of WLANs and mobile Ad Hoc networks, which have become the key techniques of next-generation wireless networks in the context of emergency recovery. Wireless Mesh Networks (WMNs) are multi-hop wireless networks with instant deployment, self-healing, self-organization and self-configuration features. These capabilities make WMNs a promising technology for incident and emergency communication. An incident area network (IAN) needs a reliable and lively routing path during disaster recovery and emergency response operations when infrastructure-based communications and power resources have been destroyed and no routes are available. Power aware routing plays a significant role in WMNs, in order to provide continuous efficient emergency services. The existing power aware routing algorithms used in wireless networks cannot fully fit the characteristics of WMNs, to be used for emergency recovery. This paper proposes a power aware routing algorithm (PARA) for WMNs, which selects optimal paths to send packets, mainly based on the power level of next node along the path. This algorithm was implemented and tested in a proven simulator. The analytic results show that the proposed power node-type aware routing algorithm metric can clearly improve the network performance by reducing the network overheads and maintaining a high delivery ratio with low latency. [ABSTRACT FROM AUTHOR]

Tie strength and tags have been separately suggested as possible attributes for photo access controls in Social Network Services. However, an evaluation is missing about the benefits/drawbacks of adding one or both of these attributes to the ones already used in access controls for Social Network Services (groups and individuals). In this paper, we describe an experiment with 48 participants using access controls that include tie strength and tags (separately and simultaneously) together with attributes for groups and individuals. We analyze the results using several quantitative and qualitative metrics. We find that users consider these two new attributes useful in defining their sharing policies, and they prefer to employ access controls that consider tags and tie strength jointly. Specifically, users believe that tie strength improves policy understandability and that tags help them define sharing policies faster. However, we also observe that when users employ these two attributes they tend to make more mistakes in terms of the resulting sharing policy. We hypothesize that this could be caused by the lack of experience using tie strength and tags in access controls. [ABSTRACT FROM AUTHOR]

The research about unmanned aerial vehicle (UAV) swarm has developed rapidly in recent years, especially the UAV swarm with sensors which is becoming common means of achieving situational awareness. Due to inadequate researches of the UAV swarm with complex control structure currently, we propose a patrolling task planning algorithm for the UAV swarm with double-layer centralized control structure under the uncertain and dynamic environment. The main objective of the UAV swarm is to collect environment information as much as possible. To summarized, the primary contributions of this paper are as follows. We first define the patrolling problem. After that, the patrolling problem is modeled as the Partially Observable Markov Decision Process (POMDP) problem. Building upon this, we put forward a myopic and scalable online task planning algorithm. The algorithm contains online heuristic function, sequential allocation method, and the mechanism of bottom-up information flow and top-down command flow, reducing the computation complexity effectively. Moreover, as the number of control layers increases, this algorithm guarantees the performance without increasing the computation complexity for the swarm leader. Finally, we empirically evaluate our algorithm in the specific scenarios. [ABSTRACT FROM AUTHOR]

Predicting and analyzing behaviors of investors is of great value to financial institutions. This paper uses survey data from about 9,000 individual investors across China to explore the predictability of decision behaviors by studying demographic characteristics that are relatively easy to obtain. After applying Pearson’s chi-squared test, Spearman rank correlation test, and several data mining methods, we verified that demographic characteristics are closely linked to decision behaviors, and it would be an economical and feasible solution for financial organizations to build initial behavioral prediction models especially when investors’ behavioral data are insufficient. [ABSTRACT FROM AUTHOR]

In this paper, we propose a sentiment-based approach to investigate the temporal and spatiotemporal effects on tourists’ emotions when visiting a city’s tourist destinations. Our approach consists of four steps: data collection and preprocessing from social media; visitor origin identification; visit sentiment identification; and temporal and spatiotemporal analysis. The temporal and spatiotemporal dimensions include day of the year, season of the year, day of the week, location sentiment progression, enjoyment measure, and multi-location sentiment progression. We apply this approach to the city of Chicago using over eight million tweets. Results show that seasonal weather, as well as special days and activities like concerts, impact tourists’ emotions. In addition, our analysis suggests that tourists experience greater levels of enjoyment in places such as observatories rather than zoos. Finally, we find that local and international visitors tend to convey negative sentiment when visiting more than one attraction in a day whereas the opposite holds for out of state visitors. [ABSTRACT FROM AUTHOR]

Finding communities in multilayer networks is a vital step in understanding the structure and dynamics of these layers, where each layer represents a particular type of relationship between nodes in the natural world. However, most community discovery methods for multilayer networks may ignore the interplay between layers or the unique topological structure in a layer. Moreover, most of them can only detect non-overlapping communities. In this paper, we propose a new community discovery method for multilayer networks, which leverages the interplay between layers and the unique topology in a layer to reveal overlapping communities. Through a comprehensive analysis of edge behaviors within and across layers, we first calculate the similarities for edges from the same layer and the cross layers. Then, by leveraging these similarities, we can construct a dendrogram for the multilayer networks that takes both the unique topological structure and the important interplay into consideration. Finally, by introducing a new community density metric for multilayer networks, we can cut the dendrogram to get the overlapping communities for these layers. By applying our method on both synthetic and real-world datasets, we demonstrate that our method has an accurate performance in discovering overlapping communities in multilayer networks. [ABSTRACT FROM AUTHOR]

Micro-blogging systems have become one of the most important ways for information sharing. Network structure and users’ interactions such as forwarding behaviors have aroused considerable research attention, while mention, as a key feature in micro-blogging platforms which can improve the visibility of a message and direct it to a particular user beyond the underlying social structure, is seldom studied in previous works. In this paper, we empirically study the mention effect in information diffusion, using the dataset from a population-scale social media website. We find that users with high number of followers would receive much more mentions than others. We further investigate the effect of mention in information diffusion by examining the response probability with respect to the number of mentions in a message and observe a saturation at around 5 mentions. Furthermore, we find that the response probability is the highest when a reciprocal followship exists between users, and one is more likely to receive a target user’s response if they have similar social status. To illustrate these findings, we propose the response prediction task and formulate it as a binary classification problem. Extensive evaluation demonstrates the effectiveness of discovered factors. Our results have consequences for the understanding of human dynamics on the social network, and potential implications for viral marketing and public opinion monitoring. [ABSTRACT FROM AUTHOR]

Psychological and other persuasive mechanisms across diverse contexts are well researched, with many studies of the effectiveness of specific persuasive techniques on distinct types of human behaviour. In the present paper, our specific interest lies in the development of a generalized modular psychometric tool to measure individuals’ susceptibility to persuasion. The scale is constructed using items from previously developed and validated particulate scales established in the domains of social psychology and behavioural economics. In the first study we establish the Susceptibility to Persuasion–II (StP-II) scale, containing 54 items, 10 subscales and further 6 sub-sub scales. In Study 2 we establish the scale’s construct validity and reconfirm its reliability. We present a valid and reliable modular psychometric tool that measures general susceptibility to persuasive techniques. Since its inception, we have successfully implemented the StP-II scale to measure susceptibility to persuasion of IT security officers, the role of psychology of persuasion in cybercrime victims and general persuadability levels of Facebook users; these manuscripts are in preparation. We argue that the StP-II scale shows promise in measuring individual differences in susceptibility to persuasion, and is applicable across diverse contexts such as Internet security and cybercrime. [ABSTRACT FROM AUTHOR]

Objective: To examine the use of the term ‘metric’ in health and social sciences’ literature, focusing on the interval scale implication of the term in Modern Test Theory (MTT). Materials and methods: A systematic search and review on MTT studies including ‘metric’ or ‘interval scale’ was performed in the health and social sciences literature. The search was restricted to 2001–2005 and 2011–2015. A Text Mining algorithm was employed to operationalize the eligibility criteria and to explore the uses of ‘metric’. The paradigm of each included article (Rasch Measurement Theory (RMT), Item Response Theory (IRT) or both), as well as its type (Theoretical, Methodological, Teaching, Application, Miscellaneous) were determined. An inductive thematic analysis on the first three types was performed. Results: 70.6% of the 1337 included articles were allocated to RMT, and 68.4% were application papers. Among the number of uses of ‘metric’, it was predominantly a synonym of ‘scale’; as adjective, it referred to measurement or quantification. Three incompatible themes ‘only RMT/all MTT/no MTT models can provide interval measures’ were identified, but ‘interval scale’ was considerably more mentioned in RMT than in IRT. Conclusion: ‘Metric’ is used in many different ways, and there is no consensus on which MTT metric has interval scale properties. Nevertheless, when using the term ‘metric’, the authors should specify the level of the metric being used (ordinal, ordered, interval, ratio), and justify why according to them the metric is at that level. [ABSTRACT FROM AUTHOR]

The existence of a shared classification system is essential to knowledge production, transfer, and sharing. Studies of knowledge classification, however, rarely consider the fact that knowledge categories exist within hierarchical information systems designed to facilitate knowledge search and discovery. This neglect is problematic whenever information about categorical membership is itself used to evaluate the quality of the items that the category contains. The main objective of this paper is to show that the effects of category membership depend on the position that a category occupies in the hierarchical knowledge classification system of Wikipedia—an open knowledge production and sharing platform taking the form of a freely accessible on-line encyclopedia. Using data on all English-language Wikipedia articles, we examine how the position that a category occupies in the classification hierarchy affects the attention that articles in that category attract from Wikipedia editors, and their evaluation of quality of the Wikipedia articles. Specifically, we show that Wikipedia articles assigned to coarse-grained categories (i. e., categories that occupy higher positions in the hierarchical knowledge classification system) garner more attention from Wikipedia editors (i. e., attract a higher volume of text editing activity), but receive lower evaluations (i. e., they are considered to be of lower quality). The negative relation between attention and quality implied by this result is consistent with current theories of social categorization, but it also goes beyond available results by showing that the effects of categorization on evaluation depend on the position that a category occupies in a hierarchical knowledge classification system. [ABSTRACT FROM AUTHOR]

With the continuing growth of multi-media learning resources, it is important to offer methods helping learners to explore and acquire relevant learning information effectively. As services that organize multi-media learning materials together to support programming learning, the digital case-based learning system is needed. In order to create a case-oriented e-learning system, this paper concentrates on the digital case study of multi-media resources and learning processes with an integrated framework. An integration of multi-media resources, testing and learning strategies recommendation as the learning unit is proposed in the digital case-based learning framework. The learning mechanism of learning guidance, multi-media materials learning and testing feedback is supported in our project. An improved personalized genetic algorithm which incorporates preference information and usage degree into the crossover and mutation process is proposed to assemble the personalized test sheet for each learner. A learning strategies recommendation solution is proposed to recommend learning strategies for learners to help them to learn. The experiments are conducted to prove that the proposed approaches are capable of constructing personalized sheets and the effectiveness of the framework. [ABSTRACT FROM AUTHOR]

This paper explores how information flow properties of a network affect the formation of categories shared between individuals, who are communicating through that network. Our work is based on the established multi-agent model of the emergence of linguistic categories grounded in external environment. We study how network information propagation efficiency and the direction of information flow affect categorization by performing simulations with idealized network topologies optimizing certain network centrality measures. We measure dynamic social adaptation when either network topology or environment is subject to change during the experiment, and the system has to adapt to new conditions. We find that both decentralized network topology efficient in information propagation and the presence of central authority (information flow from the center to peripheries) are beneficial for the formation of global agreement between agents. Systems with central authority cope well with network topology change, but are less robust in the case of environment change. These findings help to understand which network properties affect processes of social adaptation. They are important to inform the debate on the advantages and disadvantages of centralized systems. [ABSTRACT FROM AUTHOR]

Traffic congestion continues to be a persistent problem throughout the world. As vehicle-to-vehicle communication develops, there is an opportunity of using cooperation among close proximity vehicles to tackle the congestion problem. The intuition is that if vehicles could cooperate opportunistically when they come close enough to each other, they could, in effect, spread themselves out among alternative routes so that vehicles do not all jam up on the same roads. Our previous work proposed a decentralized multiagent based vehicular congestion management algorithm entitled Congestion Avoidance and Route Allocation using Virtual Agent Negotiation (CARAVAN), wherein the vehicles acting as intelligent agents perform cooperative route allocation using inter-vehicular communication. This paper focuses on evaluating the practical applicability of this approach by testing its robustness and performance (in terms of travel time reduction), across variations in: (a) environmental parameters such as road network topology and configuration; (b) algorithmic parameters such as vehicle agent preferences and route cost/preference multipliers; and (c) agent-related parameters such as equipped/non-equipped vehicles and compliant/non-compliant agents. Overall, the results demonstrate the adaptability and robustness of the decentralized cooperative vehicles approach to providing global travel time reduction using simple local coordination strategies. [ABSTRACT FROM AUTHOR]

A popular objective criterion for partitioning a set of actors into core and periphery subsets is the maximization of the correlation between an ideal and observed structure associated with intra-core and intra-periphery ties. The resulting optimization problem has commonly been tackled using heuristic procedures such as relocation algorithms, genetic algorithms, and simulated annealing. In this paper, we present a computationally efficient simulated annealing algorithm for maximum correlation core/periphery partitioning of binary networks. The algorithm is evaluated using simulated networks consisting of up to 2000 actors and spanning a variety of densities for the intra-core, intra-periphery, and inter-core-periphery components of the network. Core/periphery analyses of problem solving, trust, and information sharing networks for the frontline employees and managers of a consumer packaged goods manufacturer are provided to illustrate the use of the model. [ABSTRACT FROM AUTHOR]

Melioration learning is an empirically well-grounded model of reinforcement learning. By means of computer simulations, this paper derives predictions for several repeatedly played two-person games from this model. The results indicate a likely convergence to a pure Nash equilibrium of the game. If no pure equilibrium exists, the relative frequencies of choice may approach the predictions of the mixed Nash equilibrium. Yet in some games, no stable state is reached. [ABSTRACT FROM AUTHOR]

Background: Online broadcasting substantially affects the production, distribution, and profit of TV series. In addition, online word-of-mouth significantly affects the diffusion of TV series. Because on-demand streaming rates are the most important factor that influences the earnings of online video suppliers, streaming statistics and forecasting trends are valuable. In this paper, we investigate the effects of periodic impulsive stimulation and pre-launch promotion on on-demand streaming dynamics. We consider imbalanced audience feverish distribution using an impulsive susceptible-infected-removed(SIR)-like model. In addition, we perform a correlation analysis of online buzz volume based on Baidu Index data. Methods: We propose a PI-SIR model to evolve audience dynamics and translate them into on-demand streaming fluctuations, which can be observed and comprehended by online video suppliers. Six South Korean TV series datasets are used to test the model. We develop a coarse-to-fine two-step fitting scheme to estimate the model parameters, first by fitting inter-period accumulation and then by fitting inner-period feverish distribution. Results: We find that audience members display similar viewing habits. That is, they seek new episodes every update day but fade away. This outcome means that impulsive intensity plays a crucial role in on-demand streaming diffusion. In addition, the initial audience size and online buzz are significant factors. On-demand streaming fluctuation is highly correlated with online buzz fluctuation. Conclusion: To stimulate audience attention and interpersonal diffusion, it is worthwhile to invest in promotion near update days. Strong pre-launch promotion is also a good marketing tool to improve overall performance. It is not advisable for online video providers to promote several popular TV series on the same update day. Inter-period accumulation is a feasible forecasting tool to predict the future trend of the on-demand streaming amount. The buzz in public social communities also represents a highly correlated analysis tool to evaluate the advertising value of TV series. [ABSTRACT FROM AUTHOR]

In the existing centralized location services system structure, the server is easily attracted and be the communication bottleneck. It caused the disclosure of users’ location. For this, we presented a new distributed collaborative recommendation strategy that is based on the distributed system. In this strategy, each node establishes profiles of their own location information. When requests for location services appear, the user can obtain the corresponding location services according to the recommendation of the neighboring users’ location information profiles. If no suitable recommended location service results are obtained, then the user can send a service request to the server according to the construction of a k-anonymous data set with a centroid position of the neighbors. In this strategy, we designed a new model of distributed collaborative recommendation location service based on the users’ location information profiles and used generalization and encryption to ensure the safety of the user’s location information privacy. Finally, we used the real location data set to make theoretical and experimental analysis. And the results show that the strategy proposed in this paper is capable of reducing the frequency of access to the location server, providing better location services and protecting better the user’s location privacy. [ABSTRACT FROM AUTHOR]

Product aspect recognition is a key task in fine-grained opinion mining. Current methods primarily focus on the extraction of aspects from the product reviews. However, it is also important to cluster synonymous extracted aspects into the same category. In this paper, we focus on the problem of product aspect clustering. The primary challenge is to properly cluster and generalize aspects that have similar meanings but different representations. To address this problem, we learn two types of background knowledge for each extracted aspect based on two types of effective aspect relations: relevant aspect relations and irrelevant aspect relations, which describe two different types of relationships between two aspects. Based on these two types of relationships, we can assign many relevant and irrelevant aspects into two different sets as the background knowledge to describe each product aspect. To obtain abundant background knowledge for each product aspect, we can enrich the available information with background knowledge from the Web. Then, we design a hierarchical clustering algorithm to cluster these aspects into different groups, in which aspect similarity is computed using the relevant and irrelevant aspect sets for each product aspect. Experimental results obtained in both camera and mobile phone domains demonstrate that the proposed product aspect clustering method based on two types of background knowledge performs better than the baseline approach without the use of background knowledge. Moreover, the experimental results also indicate that expanding the available background knowledge using the Web is feasible. [ABSTRACT FROM AUTHOR]

Cooperation amongst resource users holds the key to overcoming the social dilemma that characterizes community-based common-pool resource management. But is cooperation alone enough to achieve sustainable resource use? The short answer is no. Developing management strategies in a complex social-ecological environment also requires ecological knowledge and approaches to deal with perceived environmental uncertainty. Recent behavioral experimental research indicates variation in the degree to which a group of users can identify a sustainable exploitation level. In this paper, we identify social-ecological micro-foundations that facilitate cooperative sustainable common-pool resource use. We do so by using an agent-based model (ABM) that is informed by behavioral common-pool resource experiments. In these experiments, groups that cooperate do not necessarily manage the resource sustainably, but also over- or underexploit. By reproducing the patterns of the behavioral experiments in a qualitative way, the ABM represents a social-ecological explanation for the experimental observations. We find that the ecological knowledge of each group member cannot sufficiently explain the relationship between cooperation and sustainable resource use. Instead, the development of a sustainable exploitation level depends on the distribution of ecological knowledge among the group members, their influence on each other’s knowledge, and the environmental uncertainty the individuals perceive. The study provides insights about critical social-ecological micro-foundations underpinning collective action and sustainable resource management. These insights may inform policy-making, but also point to future research needs regarding the mechanisms of social learning, the development of shared management strategies and the interplay of social and ecological uncertainty. [ABSTRACT FROM AUTHOR]

Recently, increasing numbers of users have adopted microblogging services as their main information source. However, most of them find themselves drowning in the millions of posts produced by other users every day. To cope with this, identifying a set of the most influential people is paramount. Moreover, finding a set of related influential users to expand the coverage of one particular topic is required in real world scenarios. Most of the existing algorithms in this area focus on topology-related methods such as PageRank. These methods mine link structures to find the expected influential rank of users. However, because they ignore the interaction data, these methods turn out to be less effective in social networks. In reality, a variety of topics exist within the information diffusing through the network. Because they have different interests, users play different roles in the diffusion of information related to different topics. As a result, distinguishing influential leaders according to different topics is also worthy of research. In this paper, we propose a multi-topic influence diffusion model (MTID) based on traces acquired from historic information. We decompose the influential scores of users into two parts: the direct influence determined by information propagation along the link structure and indirect influence that extends beyond the restrictions of direct follower relationships. To model the network from a multi-topical viewpoint, we introduce topic pools, each of which represents a particular topic information source. Then, we extract the topic distributions from the traces of tweets, determining the influence propagation probability and content generation probability. In the network, we adopt multiple ground nodes representing topic pools to connect every user through bidirectional links. Based on this multi-topical view of the network, we further introduce the topic-dependent rank (TD-Rank) algorithm to identify the multi-topic influential users. Our algorithm not only effectively overcomes the shortages of PageRank but also effectively produces a measure of topic-related rank. Extensive experiments on a Weibo dataset show that our model is both effective and robust. [ABSTRACT FROM AUTHOR]

In a connected world where people influence each other, what can cause a globalized monoculture, and which measures help to preserve the coexistence of cultures? Previous research has shown that factors such as homophily, population size, geography, mass media, and type of social influence play important roles. In the present paper, we investigate for the first time the impact that institutions have on cultural diversity. In our first three studies, we extend existing agent-based models and explore the effects of institutional influence and agent loyalty. We find that higher institutional influence increases cultural diversity, while individuals' loyalty to their institutions has a small, preserving effect. In three further studies, we test how bottom-up and top-down processes of institutional influence impact our model. We find that bottom-up democratic practices, such as referenda, tend to produce convergence towards homogeneity, while top-down information dissemination practices, such as propaganda, further increase diversity. In our last model—an integration of bottom-up and top-down processes into a feedback loop of information—we find that when democratic processes are rare, the effects of propaganda are amplified, i.e., more diversity emerges; however, when democratic processes are common, they are able to neutralize or reverse this propaganda effect. Importantly, our models allow for control over the full spectrum of diversity, so that a manipulation of our parameters can result in preferred levels of diversity, which will be useful for the study of other factors in the future. We discuss possible mechanisms behind our results, applications, and implications for political and social sciences. [ABSTRACT FROM AUTHOR]

In this paper, we have captured an underlying mechanism of emergence of collective panic in pedestrian evacuations by using a modification of the lattice-gas model. We classify the motion of pedestrians into two modes according to their moods. One is gentle (mode I), the other is flustered (mode II). First, to research the cause for crowd, we fix the motion modes of pedestrians and increase the proportion of pedestrians with motion mode II (ρII). The simulation results show that the pedestrians with motion mode II are lack of evacuation efficiency and cause more casualties. Further, we use the SIS (susceptible-infective-susceptible) model to describe the spreading of the panic mood. The system can be in the high-mix state when the infection probability λ is greater than a fuzzy threshold. In addition, the distances S from wounded people to the exit are researched, the number of wounded people gets maximum at the internal S = 5 ∼ 10, which is independent of ρII and λ. This research can help us to understand and prevent the emergence of collective panic and reduce wounds in the real evacuation. [ABSTRACT FROM AUTHOR]

Sports fans are able to watch games from many locations using TV services while interacting with other fans online. In this paper, we identify the factors that affect sports viewers’ online interactions. Using a large-scale dataset of more than 25 million chat messages from a popular social TV site for baseball, we extract various game-related factors, and investigate the relationships between these factors and fans’ interactions using a series of multiple regression analyses. As a result, we identify several factors that are significantly related to viewer interactions. In addition, we determine that the influence of these factors varies according to the user group; i.e., active vs. less active users, and loyal vs. non-loyal users. [ABSTRACT FROM AUTHOR]

Graphlets are small subgraphs, usually containing up to five vertices, that can be found in a larger graph. Identification of the graphlets that a vertex in an explored graph touches can provide useful information about the local structure of the graph around that vertex. Actually finding all graphlets in a large graph can be time-consuming, however. As the graphlets grow in size, more different graphlets emerge and the time needed to find each graphlet also scales up. If it is not needed to find each instance of each graphlet, but knowing the number of graphlets touching each node of the graph suffices, the problem is less hard. Previous research shows a way to simplify counting the graphlets: instead of looking for the graphlets needed, smaller graphlets are searched, as well as the number of common neighbors of vertices. Solving a system of equations then gives the number of times a vertex is part of each graphlet of the desired size. However, until now, equations only exist to count graphlets with 4 or 5 nodes. In this paper, two new techniques are presented. The first allows to generate the equations needed in an automatic way. This eliminates the tedious work needed to do so manually each time an extra node is added to the graphlets. The technique is independent on the number of nodes in the graphlets and can thus be used to count larger graphlets than previously possible. The second technique gives all graphlets a unique ordering which is easily extended to name graphlets of any size. Both techniques were used to generate equations to count graphlets with 4, 5 and 6 vertices, which extends all previous results. Code can be found at and . [ABSTRACT FROM AUTHOR]