K. S. Jasmine

Identification Of Software Performance Bottleneck Components In Reuse based Software Products With The Application Of Acquaintanceship Graphs

Component-based software engineering provides an opportunity for better quality and increased productivity in software development by using reusable software components [9]. Also performance is a make-or-break quality for software. The systematic application of software performance engineering techniques throughout the development process can help to identify design alternatives that preserve desirable qualities such as extensibility and reusability while meeting performance objectives [1]. Implementing the effective performance-based management of software intensive projects has proven to be challenging task now a days. This paper aims at identifying the major reasons of software performance failures in terms of the component communication path. My work focused on one of the applications of discrete mathematics namely graph theory. This study makes an attempt to predict the most used components to the least used with the help of acquaintanceship graphs and also the shortest communication path between any two components with the help of adjacency matrix. Experiments are conducted with four components and the result shows a promising approach towards component utilization and bottleneck determination that describe the major areas in the component communication to concentrate in achieving success in cost-effective development of highly performance software.

Secure End-To-End Authentication for Mobile Banking

The advancement in technology makes Mobile Banking transaction more sophisticated. The OTP SMS is generated by the bank server and is handed over to the client’s mobile subscriber. To avoid any possible attacks like phishing and other attacks, the OTP must be secured. In order to provide reliable and secure mobile transactions without any compromise to convenience, a reliable m-banking authentication scheme that combines the secret PIN with encryption of the one-time password (OTP) has been developed in this paper. The secured OTP while using eZeeMPay salt algorithm seek to give the more secured m-banking transaction. After the encrypted OTP SMS reaches the client’s mobile, the OTP is used again used for decrypting. The plain OTP text should be sent back to the bank will verified at the server to complete the transaction initiated. The combination of OTP with secured OTP provides authentication and security.

A New Architecture of Mobile Payment System through Social Media Network

The financial services industry is changing rapidly as a result of advances in information technology, telecommunications and the Internet. Technological innovations and increasing customer demand have led to the emergence of new services and new organizational forms for financial services firms. The gait of innovation in the Social media, the payment system is staggering. The biggest social media sites are Facebook, massive and used by almost everyone, Twitter, the micro-blogging, and LinkedIn, the online professional networking site. By using the social media connections as a method to exchange the funds, we can integrate our use of mobile wallets, PayPal, etc. to our social media sites. Believing on daily deal platforms, none of the current daily deal platforms can compete with the granularity and relevance with which banks could target a deal to a specific subscriber, having access to their extensive spending history and preferences. A feedback loop extending from the Bank to the merchants enabling the creation of accurate list of customers who consistently spend in specific retail categories can help merchants in delivering targeted offers to attract new customers.

Inference in Belief Network using Logic Sampling and Likelihood Weighing algorithms

Over the time in computational history, belief networks have become an increasingly popular mechanism for dealing with uncertainty in systems. It is known that identifying the probability values of belief network nodes given a set of evidence is not amenable in general. Many different simulation algorithms for approximating solution to this problem have been proposed and implemented. This paper details the implementation of such algorithms, in particular the two algorithms of the belief networks namely Logic sampling and the likelihood weighing are discussed. A detailed description of the algorithm is given with observed results. These algorithms play crucial roles in dynamic decision making in any situation of uncertainty.