Social networking generates a huge amount of data which can throw useful insights if processed at the right time. Social computing is another emerging technique where social networking is made use for computational purpose. Cloud storage plays an important role in social computing. Privacy in social computing is still a debated issue. The privacy concerns and possible loopholes are discussed in detail. In this paper we are proposing some mathematical models to compute the probability of staying in social network and proposing an algorithm named firefly inspired algorithm for establishing connections (FIAEC). Copyright © 2015 Inderscience Enterprises Ltd.

Dhinesh Babu L-D

Department of Software and Systems Engineering

School of Information Technology and Engineering

Vellore Campus

Raj E.D

Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

A firefly swarm approach for establishing new connections in social networks based on big data analytics

International Journal of Communication Networks and Distributed Systems

With almost all educated individuals having access to computing cum communication gadgets like mobiles, tablets, PCs, and laptops, online social networks (OSNs) have become the default means of networking among majority of individuals. OSNs have become an inseparable part of daily lives attracting more than one third of the current world population. Majority of the users enjoy the entertainment aspects of OSNs like gaming with friends from different geographic locations. Social gaming has spawned a whole new sub culture which helps users to discover and build connections with other users. Game development companies constantly try to publicise and attract new users using OSNs to enhance their revenues. In this context, we propose a new firefly inspired strategy to spread and disseminate games in OSNs and assist the gaming companies to decrease the acceptance-discontinuance anomaly. Collective behaviour in online social network is closely related to swarm intelligence techniques. We have also proposed a rewarding and efficient Firefly inspired QoS-based priority pricing model that will attract more users to play online games while using online social networks, thereby, enhancing the profits of the service providers and game developers. Copyright © 2018 Inderscience Enterprises Ltd.

International Journal of Bio-Inspired Computation

A firefly inspired game dissemination and QoS-based priority pricing strategy for online social network games

Centrality in social network is one of the major research topics in social network analysis. Even though there are more than half a dozen methods to find centrality of a node, each of these methods has some drawbacks in one aspect or the other. This paper analyses different centrality calculation methods and proposes a new swarm based method named Flocking Based Centrality for Social network (FBCS). This new computation technique makes use of parameters that are more realistic and practical in online social networks. The interactions between nodes play a significant role in determining the centrality of node. The new method has been calculated both empirically as well as experimentally. The new method is tested, verified and validated for different sets of random networks and benchmark datasets. The method has been correlated with other state of the art centrality measures. The new centrality measure is found to be realistic and suits well with online social networks. The proposed method can be used in applications such as finding the most prestigious node and for discovering the node which can influence maximum number of users in an online social network. FBCS centrality has higher Kendall's tau correlation when compared with other state of the art centrality methods. The robustness of the FBCS centrality is found to be better than other centrality measures. © 2017 Elsevier B.V.

Applied Soft Computing

Flocking based evolutionary computation strategy for measuring centrality of online social networks

There has been lot of research endeavours in detecting overlapping community structures in complex networks. This paper concentrates on one of the most popular complex networks of recent times—online social networks. Some of the existing methodologies in community detection for online social networks are discussed. The goal of the proposed algorithm is to solve the stability–plasticity dilemma and to suggest a new technique for detecting modular and granular overlaps in community detection. The stability–plasticity dilemma is solved using a Fuzzy ART-inspired algorithm for overlapping community detection for detecting modular and granular overlaps. The algorithm is designed by making use of network measures such as vertex betweenness, betweenness centrality, and split betweenness. The validation metrics used for testing the algorithm were sensitivity, specificity, accuracy and normalized mutual information. The algorithm has been tested and validated using benchmark datasets and real network datasets and gives a cumulative performance of 3.1/4.0. © 2016, Taiwan Fuzzy Systems Association and Springer-Verlag Berlin Heidelberg.

International Journal of Fuzzy Systems

Effective Detection of Modular and Granular Overlaps in Online Social Networks Using Fuzzy ART

There has been a surge in the usage and spread of online social networks in the past few years. This paper focuses on online social networks, which is the most prominent complex network in the modern world. People use online social networks for making friendships, learning, for entertainment and to review product items. This expanded impact of online social networks has prompted the rise of a research area named online social network analysis. This paper reflects the research aspects in the detection of influential nodes in online social networks with respect to topological properties, network generation models and analytical measures in online social networks. We have clearly presented the concepts, issues and future research directions in the influential node detection in online social network analysis. The factors and conditions for the evolution and growth of online social networks and the pre-requisites for generating a random graph for simulation of online social networks have been discussed. The paper gives a clear direction on the relation between computation of influential users and the properties, models and measures in online social networks. © 2017 Inderscience Enterprises Ltd.

International Journal of Web Based Communities

A survey on topological properties, network models and analytical measures in detecting influential nodes in online social networks

Online Social networks have become popular with the increased use of mobile devices. Online Social network analysis alleviates the quantitative as well as qualitative analysis of online social networks. Online social networks deals with human emotions and communications, the vagueness in the process is more and is a hindrance in computation. We analyze two network measures namely centrality and prestige by developing a fuzzy rule based inference system. We obtained the relation between interaction, centrality and prestige in online social networks. The paper describes in detail, the need for a fuzzy approach in online social network analysis and analyzes the network measures. © 2016 ACM.

Proceedings of the International Conference on Informatics and Analytics - ICIA-16

A Fuzzy Approach to Centrality and Prestige in Online Social Networks

Cloud computing has become the cutting-edge technology for information technology processing and high-end computational tasks. Cloud has started playing its part in almost all business processes. Big data in cloud has become the buzzword. The business impact of cloud has deepened with the growth of big data analytics. Current trends such as green cloud computing, mobile cloud computing, and big data have created social as well as business impact. In this chapter, the authors analyze the field of cloud computing and perform an intense literature survey augmented with mathematical analysis. The forecast on the future of cloud and analysis of the current trends shows that cloud computing is a promising technology that will evolve further in years to come.

Cloud Technology

Forecasting the Trends in Cloud Computing and its Impact on Future IT Business

In cloud computing environments, resources and infrastructure are provided as a service over internet on demand. The users are interested in reducing the service cost provided by the cloud service providers. Scheduling tasks of workflows play a vital role in determining performance of cloud computing systems. Workflows have many tasks in it and are interdependent on each other. Time critical workflows comprise of a collection of tasks which should be completed as early as possible so that other workflows get its turn. The budget involved in executing the time critical tasks is very high. The execution cost increases whenever we try to reduce the execution time. In this paper, we propose a method called versatile time-cost algorithm (VTCA) to schedule time critical workflows with minimum cost. VTCA will schedule the tasks to complete in earliest possible time as well as optimise the cost involved in resource provisioning. The results of experiments conducted using CloudSim simulator show that our scheduling policy minimises the completion time of workflows than other existing algorithms like min-min and fair max-min by 5% to 30% and it also reduces the costs by 5% to 35%. © 2013 Inderscience Enterprises Ltd.

Versatile time-cost algorithm (VTCA) for scheduling non-preemptive tasks of time critical workflows in cloud computing systems

Cloud computing has emerged as a buzzword of IT-enabled business services. It makes business sense to choose an optimal location for setting up the cloud service facilities such as data centres. The distribution of services between data centre facilities and clients of a cloud can be devised mathematically as the well-known facility location problem (FLP). The decisions of location of data centres are a vital element in strategic planning for a wide range of cloud service providers. In this paper, we have applied facility location techniques in operations management for evaluating the available potential locations and zero down to the best optimal facility location, which can be used to minimise the cost associated with setting up of data centre facilities. A case study is also presented applying FLP in Indian cloud computing scenario. By using these techniques, one can ensure desired QoS and optimum use of data centre facilities. Copyright © 2013 Inderscience Enterprises Ltd.

Journal	International Journal of Communication Networks and Distributed Systems
Publisher	Inderscience Publishers
ISSN	1754-3916
Open Access	No