No abstract

No abstract

No abstract

Socialization refers to the lifelong process of inheriting and disseminating norms, customs and ideologies, providing an individual with the skills and habits necessary for participating within his or her own society. The process of socialization is operative not only in childhood but throughout life. Traditional agents of socialization include family, age mates, teachers and mass media. But now-a-days, in a world dominated by technology, social media also play a vital role in socialization. Social media drastically change the Internet and public relations landscape for everyone with Internet-access and a desire to friend, tweet and update a status. Billions of people are now creating and sharing massive amounts of data with one another. Disappearing barriers with a view to producing information and interacting with other people, social media have started the Social Data Revolution. These data too contain in capsule form, the premise of our culture, its attitudes and ideologies. The words are always written by someone and these people too join the teachers, the peers, the parents in the socialization process. In this paper, we investigate the role of social media in socialization process by mining the social web.

Delay tolerant networks (DTN), are wireless networks in which at any given time instance, the probability that there is an end-to-end path from a source to a destination is low. So, the conventional solutions do not generally work in DTNs because they assume that the network is stable most of the time and failures of links between nodes are infrequent. Therefore, store-carry-and-forward paradigm is used in routing of messages in DTNs. To deal with DTNs, researchers have suggested to use flooding-based routing schemes. While flooding-based schemes have a high probability of delivery, they waste a lot of energy and suffer from severe contention, which can significantly degrade their performance. For this reason, a family of multi-copy protocols called Spray routing, was proposed which can achieve both good delays and low transmissions. Spray routing algorithms generate only a small, carefully chosen number of copies to ensure that the total number of transmissions is small and controlled. Spray and Wait sprays a number of copies into the network, and then waits till one of these nodes meets the destination. In this paper, we propose a set of spraying heuristics that dictates how replicas are shared among nodes. These heuristics are based on delivery probabilities derived from contact histories.