oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 5 )

2018 ( 12 )

2017 ( 13 )

2016 ( 15 )

Custom range...

Search Results: 1 - 10 of 2245 matches for " Suman Saha "
All listed articles are free for downloading (OA Articles)
Page 1 /2245
Display every page Item
Consideration Points Detecting Cross-Site Scripting
Suman Saha
Computer Science , 2009,
Abstract: Web application (WA) expands its usages to provide more and more services and it has become one of the most essential communication channels between service providers and the users. To augment the users experience many web applications are using client side scripting languages such as JavaScript but this growing of JavaScript is increasing serious security vulnerabilities in web application too, such as cross site scripting (XSS). In this paper, I survey all the techniques those have been used to detect XSS and arrange a number of analyses to evaluate performances of those methodologies. This paper points major difficulties to detect XSS. I do not implement any solution of this vulnerability problem because my focus is for reviewing this issue. But, I believe that this assessment will be cooperative for further research on this concern as this treatise figure out everything on this transcendent security problem.
Network Community Detection on Metric Space
Suman Saha,Satya P. Ghrera
Computer Science , 2015, DOI: 10.3390/a8030680
Abstract: Community detection in a complex network is an important problem of much interest in recent years. In general, a community detection algorithm chooses an objective function and captures the communities of the network by optimizing the objective function, and then, one uses various heuristics to solve the optimization problem to extract the interesting communities for the user. In this article, we demonstrate the procedure to transform a graph into points of a metric space and develop the methods of community detection with the help of a metric defined for a pair of points. We have also studied and analyzed the community structure of the network therein. The results obtained with our approach are very competitive with most of the well-known algorithms in the literature, and this is justified over the large collection of datasets. On the other hand, it can be observed that time taken by our algorithm is quite less compared to other methods and justifies the theoretical findings.
Nearest Neighbor search in Complex Network for Community Detection
Suman Saha,S. P. Ghrera
Computer Science , 2015,
Abstract: Nearest neighbor search is a basic computational tool used extensively in almost research domains of computer science specially when dealing with large amount of data. However, the use of nearest neighbor search is restricted for the purpose of algorithmic development by the existence of the notion of nearness among the data points. The recent trend of research is on large, complex networks and their structural analysis, where nodes represent entities and edges represent any kind of relation between entities. Community detection in complex network is an important problem of much interest. In general, a community detection algorithm represents an objective function and captures the communities by optimizing it to extract the interesting communities for the user. In this article, we have studied the nearest neighbor search problem in complex network via the development of a suitable notion of nearness. Initially, we have studied and analyzed the exact nearest neighbor search using metric tree on proposed metric space constructed from complex network. After, the approximate nearest neighbor search problem is studied using locality sensitive hashing. For evaluation of the proposed nearest neighbor search on complex network we applied it in community detection problem. The results obtained using our methods are very competitive with most of the well known algorithms exists in the literature and this is verified on collection of real networks. On the other-hand, it can be observed that time taken by our algorithm is quite less compared to popular methods.
Link Analysis to Visualize a Web Graph
Chandresh Pratap Singh,Suman Saha,Suman Kumar Saurabh
International Journal of Computer Science Issues , 2012,
Abstract: Day by day the web size is growing enormously because at each and every second data is uploaded and downloaded from the web. Some data have proper link to address its location over the web but some data do not provide its proper link that causes the un-accessing of the document. So, it is very difficult to find matches in data for known patterns of interest and also to discover new patterns of interest. This problem can be solved by Web Link analysis technique.web link analysis is a data analysis technique used to evaluate relationship (connections) between nodes. In a web graph, nodes represent web pages and edge represents hyperlinks. In this paper, we have proposed a technique that helps to visualize a web graph of a specific domain. It provides a better understandable view of a large web.
A Methodology for Selection of Optimum Power Rating of Propulsion Motor of Three Wheeled Electric Vehicle on Indian Drive Cycle (IDC)
Prasun Mishra,Suman Saha,H. P. Ikkurti
International Journal on Theoretical and Applied Research in Mechanical Engineering , 2013,
Abstract: Optimum power rating of propulsion motor is an important issue for designing efficient drive train for a three wheeled battery operated electric vehicle application on standard drive cycle like Indian Drive Cycle of Indian urban and suburban areas. This paper deals with proper estimation of power rating of electric motor by root means square technique while considering the limitations of overloading and under loading operation of motor used in electric vehicle along with some specified design parameters, aiming towards better performance than that of a conventional IC engine driven vehicle. Dynamics of three wheeled vehicle is simulated on MATLAB/Simulink environment under a sequence of road grade angle variation in Indian Drive cycle (IDC), which is formulated by Automotive Research Association of India, Pune. Using simulated vehicle dynamics, power rating of the motor is estimated so that it can be operated efficiently and safely throughout the entire Indian drive Cycle.
A Simplification of a Real-Time Verification Problem
Indranil Saha,Janardan Misra,Suman Roy
Computer Science , 2010, DOI: 10.1007/978-3-540-75596-8_21
Abstract: We revisit the problem of real-time verification with dense dynamics using timeout and calendar based models and simplify this to a finite state verification problem. To overcome the complexity of verification of real-time systems with dense dynamics, Dutertre and Sorea, proposed timeout and calender based transition systems to model the behavior of real-time systems and verified safety properties using k-induction in association with bounded model checking. In this work, we introduce a specification formalism for these models in terms of Timeout Transition Diagrams and capture their behavior in terms of semantics of Timed Transition Systems. Further, we discuss a technique, which reduces the problem of verification of qualitative temporal properties on infinite state space of (a large fragment of) these timeout and calender based transition systems into that on clockless finite state models through a two-step process comprising of digitization and canonical finitary reduction. This technique enables us to verify safety invariants for real-time systems using finite state model-checking avoiding the complexity of infinite state (bounded) model checking and scale up models without applying techniques from induction based proof methodology. Moreover, we can verify liveness properties for real-time systems, which is not possible by using induction with infinite state model checkers. We present examples of Fischer's Protocol, Train-Gate Controller, and TTA start-up algorithm to illustrate how such an approach can be efficiently used for verifying safety, liveness, and timeliness properties specified in LTL using finite state model checkers like SAL-smc and Spin. We also demonstrate how advanced modeling concepts like inter-process scheduling, priorities, interrupts, urgent and committed location can be specified as extensions of the proposed specification formalism.
Lasiodiplodia theobromae keratitis: a rare fungi from eastern India
Suman Saha,Jayangshu Sengupta,Debdulal Banerjee,Archana Khetan
Microbiology Research , 2012, DOI: 10.4081/mr.2012.e19
Abstract: We report here a case of a 32-year old female with a history of minor trauma presented with total corneal ulcer and hypopyon in the left eye. Microbiological examination of corneal scraping showed refractile hyphae with asepted branching filaments and black pigmented colonies in multiple solid agar medium. Identification of the organism was made from culture using D1/D2 region of Large Sub Unit (28S rDNA) based molecular technique. Polymerase chain reaction amplified a band with a sequence that was 100% homologous with Lasiodiplodia theobromae. The organism was sensitive to amphotericin B and voriconazole, and demonstrated resistance to itraconazole and fluconazole. Therapeutic keratoplasty was performed followed by recurrence in graft controlled with topical voriconazole and intracameral amphotericin B. Graft failure was reported after three months.
Epidemiological profile of fungal keratitis in urban population of West Bengal, India
Saha Suman,Banerjee Debdulal,Khetan Archana,Sengupta Jayangshu
Oman Journal of Ophthalmology , 2009,
Abstract: Background : Corneal diseases are one of the major causes of visual loss and blindness, second only to cataract. Amongst corneal diseases, microbial keratitis is a major blinding disease. In some countries, fungal keratitis accounts for almost 50% of patients with culture-proven microbial keratitis. Aim : This study was conducted to determine the epidemiological characteristics of fungal keratitis in an urban population of West Bengal and identify the specific pathogenic organisms. Methods : The charts of patients with microbial keratitis who attended the Cornea Services of Priyamvada Birla Aravind Eye Hospital from January to December 2008 were retrospectively reviewed. Records of patients with 10% KOH mount and culture positive fungal keratitis were analyzed for epidemiological features, laboratory findings and treatment outcomes. Results : Of the 289 patients of microbial keratitis included in the study, 110 patients (38.06%) were diagnosed with fungal keratitis (10% KOH mount positive). Of the 110 patients, 74 (67.27%) fitted the study inclusion criteria (10% KOH mount and culture positive). Forty five of 74 patients (60.81%) in the study group were in the older age group (>50 years). Ocular trauma in 35 cases (47.29%) was identified as a high risk factor and vegetative injuries in 17 cases (22.97%) were identified as a significant cause for fungal keratitis. Maximum organism source was from corneal scrapings in 41 cases (55%). The predominant fungal species isolated was Aspergillus sp (55.40%) followed by Candida albicans 14 cases (18.91%) and Fusarium sp. in 8 cases (10.81%). Agricultural activity related ocular trauma was the principal cause of mycotic keratitis and males were more commonly affected. Thirty of 74 cases (40.55%) of the culture positive patients healed with corneal scar formation with medical treatment whereas 44 cases (59.45%) required therapeutic keratoplasty. Conclusion : Fungal keratitis is an important cause of microbial keratitis with injury to the cornea being a leading predisposing factor. Although Aspergillus sp. was implicated in most of the patients in our study population, Candida sp. were found in higher numbers than previously reported. Keratitis caused by filamentous fungi responds adequately to medical management. Therapeutic keratoplasty continues to remain an important treatment modality in infections with Candida sp. Early diagnosis with prompt identification of the pathogenic organism is mandatory to initiate appropriate therapy and thereby reduce morbidity.
VOIP Performance Over Broadband Wireless Networks Under Static and Mobile Environments
Anindita Kundu,Iti Saha Misra,Salil K. Sanyal,Suman Bhunia
International Journal of Wireless & Mobile Networks , 2010,
Abstract: Voice over IP is expected to be very promising application in the next generation communicationnetworks. The objective of this paper is to analyse the VoIP performance among the most competing nextgeneration wireless networks like WiMAX, WLAN and its integrated frameworks etc. WiMAX havinghigher bandwidth provides higher capacity but with degraded quality of service while WLAN provideslow capacity and coverage. Hence, an integrated network using WiMAX backbone and WLAN hotspotshas been developed and VoIP application has been setup. As OPNET 14.5.A provides a real lifesimulation environment, we have opted OPNET as the simulation platform for all performance studies inthis work. Quality of the service is critically analysed with parameters like jitter, MOS and delay forvarious voice codecs in the aforesaid networks for both fixed and mobile scenario. Finally, it is observedand concluded that the WiMAX-WLAN integrated network provides improved and optimal performanceover WLAN and WiMAX network with respect to network capacity and quality of service. Exhaustivesimulation results have been provided.
An Optimization Technique for Improved VoIP Performance over Wireless LAN
Tamal Chakraborty,Atri Mukhopadhyay,Suman Bhunia,Iti Saha Misra
Journal of Networks , 2012, DOI: 10.4304/jnw.7.3.480-493
Abstract: The performance of wireless LANs is greatly affected by pathloss, RF interference and other sources of signal attenuation, in addition to network congestion. The primary factors involved in effective real-time communication, namely delay and loss, must be within certain controlled limits in such a scenario. In this paper, we analyze the various factors driving IEEE 802.11b access points through extensive simulations and thereafter develop an optimization technique to configure the parameters of the access points. We simulate our test bed scenario and apply the developed algorithm. We then implement the configured parameters in our SIP enabled test bed to provide optimum Voice over IP (VoIP) performance. Thereafter, we further analyze and optimize the parameters of the communicating nodes being realized through Xlite soft phones that enhance VoIP performance to a much better extent both for voice and video calls. Test bed results confirm an improvement from 22% packet loss to 3% considering both AP and node configurations together. Finally, we propose optimization algorithm for proper selection of threshold parameters in active queue management system. Results verify significant performance improvement in VoIP under congested scenarios. Simulation and measured results have also been included.
Page 1 /2245
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.