Thursday, 15 January 2015

DETERMINING EVOLVING THEMES IN SHARED NETWORK THROUGH RELATIONSHIP ABNORMALITY RECOGNITION




Mr.N.Vignesh1, Ms.P.Salomi2
1PG student- Department of CSE - Vellammal college of Engineering and technology, Madurai, Tamilnadu, India.
2Assistant Professor - Department of CSE- Vellammal college of Engineering and technology, Madurai, Tamilnadu, India.

                Communication over social networks, such as Facebook and Twitter, is gaining its importance in our daily life. Since the information exchanged over social networks is not only texts but also URLs, images, and videos, they are challenging test beds for the study of data mining. Our basic assumption is that a new (emerging) topic is something people feel like discussing, commenting, or forwarding the information further to their friends. Conventional approaches for topic detection have mainly been concerned with the frequencies of (textual) words. A term-frequency-based approach could suffer from the ambiguity caused by synonyms or homonyms. In the Existing System, they propose a probability model of the mentioning behaviour of a social network user, and propose to detect the emergence of a new topic from the anomalies measured through the model. Aggregating anomaly scores from hundreds of users, they show that they can detect emerging topics only based on the reply/mention relationships in social-network posts. They demonstrate their technique in several real data sets they gathered from Twitter. In some cases much earlier when the topic is poorly identified by the textual contents in posts.For this, we enhance the existing work by combining the existing link-anomaly model with text-based approaches. Because the existing link-anomaly model does not immediately tell what the anomaly is. Combination of the word-based approach with the link-anomaly model would benefit both from the performance of the mention model and the intuitiveness of the word-based approach. It is implemented by using the technique text based change-point detection method for word based approach.
Share:

THE VISION OF SMART AND SAFE CITIES



J.AshaDevi, R.BanuSree, P.Suganya, S.Sakkaravarthi
1  J.AshaDevi, Sree Sowdambika College Of Engineering , Aruppukottai,India.
2  R.BanuSree,, Sree Sowdambika College Of Engineering , Aruppukottai,India.
3  P.Suganya, Sree Sowdambika College Of Engineering, Aruppukottai,India.
4  S.Sakkaravarthi, AP/CSE, Sree Sowdambika College Of Engineering, Aruppukottai,India.

Today world scenario Safety is more important to everyone. For living and working or studying we need to choose a safe place and also smart city. Based on this motto we develop our project VISION OF SMART AND SAFE CITY. We implement a safe city provider to protect our area from various problems. Using social network we connect public and government agencies to rectify the social issues.  In google map we update the rating of particular area. From the google map everyone able to see the current situations of city. Our project is very useful to view the updates of rating area from this we can easily find the safe place. We introduce iSafe, a privacy preserving algorithm for computing safety snapshots of co-located mobile devices as well as geosocial network users. We present implementation details of iSafe, as both an Android application and a browser plugin, that visualizes safety levels of visited locations and browsed geosocial venues.


Share:

TRAFFIC SPLITTING IN MULTIPATH WIRELESS NETWORK


Ms.E.Pandiyammal1, Mr.P.N.Karthikayan2
1PG student- Department of CSE - Vellammal college of Engineering and technology, Madurai, Tamilnadu, India.
2Assistant Professor - Department of CSE- Vellammal college of Engineering and technology, Madurai, Tamilnadu, India.
In network, multiple paths are existing between source and destination. Source splits the traffic among its entire available path. But how we achieve the lowest transmission rate per unit time is a problem here. If any traffic terminus between two nodes then consumes the reverse path for packet transmission. This type of packet transmission method is called as “REVERSE CARPOOLING”. And also the reverse path is called as “HYPERLINKS”. In reverse carpooling technique, use the longer paths at lowest cost by conveying a hyperlink capacity to each node. Conversely there is a strange situation among sources (i.e.) if there is traffic in both directions of a shared path, deliberate as a problem of routing with network coding. By conveying a hyperlink capacity, permitting sources to split their traffic selfishly in a scattered fashion, and then altering the hyperlink capacity based on user actions. Additionally, each hyperlink has a scheduling restriction in terms of the maximum number of transmissions allowed per unit time.

 

Share: