http://localhost:8081/jspui/handle/123456789/116 2025-07-04T07:38:13Z http://localhost:8081/jspui/handle/123456789/17693 Title: AN APPROACH TO WEB SERVICE SELECTION USING GENETIC ALGORITHM Authors: Bharti, Anjali Abstract: A web service has many implementations, all of which have the same functionality but different QoS attribute value. Therefore, selection of more suitable web service among the set of web services with the same functionality is very complex process. These web services of same functionality brought dynamic web service selection. In the web service technology various selection algorithms are used for the service selection such as evolutionary and non evolutionary algorithms. The Genetic Algorithm is based on biological evolution where population of Web services is produced by Genetic Operators. The Genetic algorithm involved three major tasks i.e. selection, crossover and the mutation. The selection is the one of the important process in the Genetic algorithm. The selection of web services depends on its fitness value or rank of the web services. The selection method used here is Rank based roulette wheel selection. In this work, detailed description of Genetic Algorithm with the rank based roulette wheel selection for the web service selection. 2015-05-01T00:00:00Z http://localhost:8081/jspui/handle/123456789/17691 Title: STREAM CIPHER CONNECTION POLYNOMIAL AND CRYPTANALYSIS Authors: Singh, Shashank Sheshar Abstract: In stream cipher design, linear feedback shift registers (LFSR) are very important role. LFSR output is dependent on connection polynomial that is used in LFSR design. We need to provide random key-stream so that for attacker it is hard to predict the key that we used for encryption. Shift registers are pillars to generate a long random sequence, this randomness increases if we used primitive polynomial as connection polynomial because it has maximum period. We are providing two primitive polynomial generation algorithms factorization and matrix based algorithm. Performance analysis of both factorization and matrix based algorithm for primitive polynomial generation that produce all degree-d primitive polynomials 'i' (2'-1)/d is existing, where 'v is the Euler's totient function. Factorization as well as matrix based algorithm both obtained each and every new degree-d primitive polynomial in polynomial time complexity 0 (k.d4.In r) and 0 (d4) time respectively with k number of distinct prime factors of maximum period 2d • 0 (d2) extra storage required for both algorithms. Comparative analysis of both algorithm with exhaustive algorithm is presented in terms of execution time and complexity. This report presents fast methods to find primitive polynomial using some properties related to irreducibility, square free polynomials and primitiveness. Massey algorithm used for recovering connection polynomial of LFSR is also present in report with an example. 2015-05-01T00:00:00Z http://localhost:8081/jspui/handle/123456789/17689 Title: REDUCING FRAME LOSS AND TIME IN MOBILE VIDEO TRANSMISSION FRQM CLOUD Authors: Pal, Anil Abstract: Due to increase in the numbers of smartphones users, traffic generated by them has become a major challenge for mobile network industry. Not only mobile industry but also mobile users face problems due to worst traffic generated by mobile users. Most of the traffic generated by mobile users is video traffic. Two major problems in mobile videos transmission are maintaining high quality of video and less energy consumption at mobile user side. In recent years many solutions has been proposed for maintaining high quality of video while some of them used adapting different bit rate encoding for video transmission which compromises video quality. Some other solutions also exists which used mobile networks behaviours and manage data to be transmitted to mobile users. Major disadvantage of these solutions is that monitoring network condition is not efficient. In this thesis work we tried to solve the problem by using cloud. We have proposed regional cloud according to the regional people's behaviour. These clouds are nears to people and contains only those videos which are most popular on that region and we can update those regional clouds according to the peoples requirements. The proposed regional cloud is expected to reduce the frame loss rate of a video and its transmission time. The results also indicate the same. 2015-05-01T00:00:00Z http://localhost:8081/jspui/handle/123456789/17686 Title: Conversation Timeline: Tracing Tête-a-Tête in News Media Authors: Srivastava, Anunaya Abstract: Today there is vast amount of information/news available on the World Wide Web in the 'form of news articles, blogs and microblogs. Everyday the news media is filled with news L about various entities commenting about different events. Thus each event generates a series of conversations between different entities of interest. It would be very interesting for a user to discover how a specific entity has conversed with other entities in the news media about various events happened within a certain time period.We propose a novel visualization technique, "Conversation Timeline" that chronologically displays the conversations of a given entity with other unknown entities which have been reported in news media. We have used news headlines to extract these conversations since news headlines contain the key idea of the comments made by an entity. We use relation extraction algorithm to retrieve conversations from the text. We propose a pre-processing step that syntactically alter the headlines so as the relation extraction module can generate better quality relations. We believe that a Conversation Timeline will give a better understanding about how an entity interacts with other entities of interest. lv 2015-05-01T00:00:00Z