Avinash Panwar

An Analytical approach based on self organized maps (SOM) in Indian classical music raga clustering

This paper is mainly focusing the aspects regarding the Self organized maps in the recognition of the Ragas and the strategy behind the Digital signal processing for the raga recognition and clustering of the same. Paper mainly describes all the features extraction mechanism for the SOM input and we devised an algorithm for creating the clusters of the raga based on their PCP (pitch class profiles) and the onsets detected. Our strategy is very promising that its providing better clusters of the raga patterns and the raga segments are very much clearly be distinguished from the other ragas, as we compared them with the formation of the key attributes. The Indian classical music history is very old and the need for identifying the music based on the raga onsets is very much helping for the music professionals and domestic users for identifying and detecting the raga types and using the same without the help or availability of any experts nearby. Thus our strategy is very promising in nature for the novice users and practitioners as well as home users. The very early learners would also find it very interesting and supportive after due course of frequent uses of it. At last we provided the future possibilities for the enhancements.

Rigorous design of moving sequencer crash tolerant atomic broadcast with unicast broadcast

This article investigates a novel mechanism of atomic broadcast in distributed systems. Various mechanisms are already given for moving sequencer based atomic broadcast like RMP [1], DTP [2] and Pin Wheel [3]. Since all these mechanisms are built on broadcast broadcast (BB) variant [4] of fixed sequencer atomic broadcast hence introduce a very large number of messages [4]. Here we propose a novel mechanism that works on unicast broadcast (UB) invariant of fixed sequencer atomic broadcast in order to build moving sequencer atomic broadcast. The proposed mechanism relies on unicast broadcast hence it will introduce a very less number of messages in comparison to previous mechanisms [4]. Along with broadcast any process may get crash any time. Hence, system must be so efficient such that it can tolerate such crashes and maintains normal behavior so that reliability of system will be maintained. The proposed work will tolerate any crash failure of processes in system and reduce the load on sequencer (by providing an opportunity to each process to be a sequencer). We have used B [5] as formal technique for development of our model. B uses set theory as a modeling notation, refinements to represent system at different abstraction level. We have used Pro B [19] model checker and animator for constraint based checking, discover errors due to invariant violation and deadlocks, thereby, validating the specifications. We present an abstract model specifying atomic broadcast with a fixed sequencer and introducing moving sequencer in first refined version then introduction of crash tolerance in second refined version.

Analytical Approach on Indian Classical Raga Measures by Feature Extraction with EM and Naive Bayes

analysis is the main task in the musical information retrieval (MIR) systems. In this paper an analytical study based on these MIR techniques has been carried out to perform analysis of the Indian classical music and Indian ragas. The ragas are further classified into various thaats and their pitch class profiles and statistical measures. This paper demonstrates the strategy by which the various raga can be categorized using these statistical measures. The choices of algorithm used are the EM algorithm and the Naive bayes algorithm. Indian classical music is very popular because of the musical styles and the emotions it can reveal. Thus MIR (musical information retrieval) and its musical analysis is a very good choice for the researchers who have both knowledge of music and computer background. This paper includes the Matlab programming environment and toolbox for the effective result simulations. The EM and naive bayes algorithm have been utilized and the open source platform has been used for the rest of the work. Keywordsalgorithm, naive bayes, Indian classical music, music information retrieval, classification, clustering.

Capturing, Analyzing, and Managing Word-of-Mouth in the Digital Marketplace

With the growth of information technologyand the Internet in particularmany new communication channels and platforms have emerged. These platforms are focused on being not only user friendly, but also highly interactive, providing many unique ways to create and distribute content.Capturing, Analyzing, and Managing Word-of-Mouth in the Digital Marketplace explores the way these new channels and platforms affect our everyday interactions, particularly as they relate to meaning, growth, and recent trends, practices, issues, and challenges surrounding the world of modern marketing. Featuring a special emphasis on social media, blogging, viral marketing, and other forms of e-communication, this timely reference source is essential for students, researchers, academics, and marketing practitioners.

A New Approach for Compression on Textual Data

Data compression algorithms are used to reduce the redundancy, storage requirement and efficiently reduce communication costs. Data Encryption is used to protect our data from unauthorized users. Due to the unprecedented explosion in the amount of digital data transmitted via the Internet, it has become necessary to develop a compression algorithm that can effectively use available network bandwidth and also taking into account the security aspects of the compressed data transmitting over Internet. This paper presents an encoding technique that offers high compression ratios. An intelligent and reversible transformation technique is applied to source text to improve the capability of algorithms to compress the transmitted data. The results prove that the proposed method performs better than many other popular techniques with respected to compression ratio and the speed of compression and requires some additional processing on the server/nodes.

Rigorous Design of moving Sequencer Omission Tolerant Atomic Broadcast

This article investigates a mechanism to tolerate omission failure in moving sequencer based atomic broadcast at distributed systems. Various mechanisms are already given for moving sequencer based atomic broadcast like RMP [1], DTP [2], Pin Wheel [3] and mechanism proposed by [4]. But none of these mechanisms are efficient to tolerate different failure. Scholarly observation is that, these algorithms can tolerate only crash failure but not capable to tolerate omission or byzantine failure. This work is an extension of [4]. This work proposes a mechanism to tolerate omission failure in moving sequencer based atomic broadcast. Hence this work is a refined version of [4]. This work relies on unicast broadcast hence it will introduce a very less number of messages in comparison to previous mechanisms [5]. B [6] has been used as formal technique for development of proposed model. B uses set theory as a modeling notation, refinements to represent system at different abstraction level. Pro B [7] has been used as model checker and animator for constraint based checking, to discover errors due to invariant violation and for deadlocks, thereby, validating the specifications.