Abstract

Adobe Flash is a popular platform frequently used for creation of advertisements, videos and interactive contents on web pages. However its utility is lost with the decreasing support of Flash players on some platforms, where open standards like HTML5 and JavaScript are widely supported. This paper describes a transformation process for converting Flash files into HTML5 and Javascript to give a human readable output. This will lend users the same resourcefulness of Flash in open standards without relying on the former.

Abstract

Financial services sector typically known as BFSI (Banking Financial Services and Insurance) invest substantial amount of their developmental and maintenance budget in Information Technology (IT). Client servicing, regulatory/compliance requirements, effective risk monitoring among others necessitate such expenditure. A large amount of time and IT expenditure in BFSI sector is spent in reengineering the legacy systems. Successful execution of these reengineering programs is critical to the firm as well as the financial markets and regulators. In this paper, we present a report of the study done on reengineering three legacy systems in BFSI sector. The focus of the paper is on challenges and issues faced, practices followed, actual data collected by Mercury Quality Center during reengineering of these systems. Our study uses key metrics, client feedback, usage of these systems, document, process repository

Abstract

The principal objective of modelling symposium is to help form an active community working on various aspects of modelling and its applications. The focus is on problems that would be critical 3-5 years out in future. For example, problem spaces such as enterprises, systems, cyber-physical systems, etc. will be given more importance. The event has keynote and 6 invited talks delivered by personnel from Academia and Industry around the world. ModSym invited students and researchers to submit posters and extended abstracts.

Abstract

Software engineering researchers and their industrial counterparts have emphasized that research is essential for innovation. In practice, rather than ending up in a win-win situation, most of the times both the parties lose because of differences in expectations between the two sides. In this report, we briefly summarize the key insights from 1st International Workshop on Software Engineering Research and Industrial Practices (SER&IPs 2014) co-located with 36th International Conference on Software Engineering (ICSE 2014). The core lesson that stems out of this workshop is a definite need to have multiple approaches to deal with software engineering research-industrial practices partnership. Specifically, the workshop presented two keynotes: one from an industrial researcher explaining the need for academic expertise and an academic researcher on how their research added value to industry. An invited …

Abstract

In extant quantum secret sharing protocols, once the secret is shared in a quantum network (qnet) it cannot be retrieved, even if the dealer wishes that his/her secret no longer be available in the network. For instance, if the dealer is part of two qnets, say Q1 and Q2 and he/she subsequently finds that Q2 is more reliable than Q1, he/she may wish to transfer all her secrets from Q1 to Q2. Known protocols are inadequate to address such a revocation. In this work we address this problem by designing a protocol that enables the source/dealer to bring back the information shared in the network, if desired. Unlike classical revocation, the no-cloning theorem automatically ensures that the secret is no longer shared in the network.

Abstract

Integrated software products are complex in design. They are prone to defects caused by integrated and non-integrated modules of the entire integrated software suite. In such software products, a small proportion of defects are fixed as soon as they are reported. Rest of the defects are targeted for fixes in future product release cycles. Among such targeted defects, most of them seem to be insignificant and innocuous in the current version but have the potential to become acute in future versions. In this paper, we propose an approach to study defect dependency of the reported defect using a dependency metric. Identifying the dependency of a defect in an integrated product suite can help the product stake-owners to prioritize them and help improve software quality.

Abstract

Multiplying two sparse matrices, denoted spmm, is a fundamental operation in linear algebra with several applications. Hence, efficient and scalable implementation of spmm has been a topic of immense research. Recent efforts are aimed at implementations on GPUs, multicore architectures, FPGAs, and such emerging computational platforms. Owing to the highly irregular nature of spmm, it is observed that GPUs and CPUs can offer comparable performance. In this paper, we study CPU+GPU heterogeneous algorithms for spmm where the matrices exhibit a scale-free nature. Focusing on such matrices, we propose an algorithm that multiplies two sparse matrices exhibiting scale-free nature on a CPU+GPU heterogeneous platform. Our experiments on a wide variety of real-world matrices from standard datasets show an average of 25% improvement over the best possible algorithm on a CPU+GPU heterogeneous platform. We show that our approach is both architecture-aware, and workload-aware.

Abstract

India has 790+ million active mobile connections and 80.57 million smartphone users. However, as per Reserve Bank of India, the number of transactions performed using smartphone based mobile banking applicationsis less than 12% of the overall banking transactions. One of the major reasons for such low numbers is the usability of the mobile banking app. In this paper, we focus on usability issues related tomobile banking apps and propose a Mobile App Usability Index (MAUI) for enhancing the usability of a mobile banking app. The proposed Index has been validatedwith mobile banking channel managers, chief information security officers, etc.

Abstract

In this work we show that given a set S of n points with coordinates on an n × n grid, we can construct data structures for (i) reporting and (ii) counting the maximal points in an axes-parallel query rectangle in sub-logarithmic time. We assume our model of computation to be the word RAM with size of each word being log n bits.

Abstract

Aspect oriented programming (AOP) is a programming paradigm that provides mechanisms for encapsulating cross-cutting concerns. Developers who want to learn AOP often experiment with aspects and different Pointcuts on their existing code bases to try and incorporate aspects into their software project. This typically involves an iterative process of testing multiple Pointcuts, partially due to the new syntax the developer has to learn, as well as to try and find the aspectual implementation that best fits their needs. Incremental weaving time is a huge factor in making this process smooth and faster for developers to more readily learn and adopt AOP. We propose an optimization approach that focuses on reducing redundant re-compilations and weaving. We propose that the approach can reduce the time being spent for weaving and thereby facilitating faster iterative project build time. We have done some initial