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 141.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 151 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.

No abstract

The sportswear industry has become prominent, popular, and a very obvious category among various age groups in India. Big sports brands like adidas, seeing the Indian market potential, have extended their businesses across the country. To increase sales, online purchase has become one the most effective, easy, cheap, and quickest solution for the end customers as it provides the end consumers a variety of products, their designs, and color combinations on clicks. A large number of consumers express what exactly the end customer thinks about a particular product's preference level of brand, quality of service, quality of product, or stylish nature of the product. The current study does an evaluation of such online comments and reviews giving their feedback on their public Twitter accounts, flipkart.com, or amazon.in about an adidas sports brand in India. The research also provides a basic flow of Java program in the form of an algorithm that is used to collect the dataset from Twitter, process it, and export it into an Excel sheet for further investigation.

Abstract-In this paper, a novel real time robot control system using human facial expressions is presented. The proposed system mainly consists of three modules: face detection, facial expression recognition and robot control. The first module aims to find the user's face from the image captured from a live video through a series of steps including skin color classification, edge detection and mathematical morphology, while the second module analyses the detected face to recognize the facial expressions like happiness, sadness, surprise, anger and neutral using Principal Component Analysis (PCA) and Euclidian distance calculation. Finally, the detected facial expressions are used as controlling commands for the robot. Experiments were conducted for respective modules. 150 images under different lightening conditions and complex background were employed. In the experiment on detecting the facial region, the rate of detection was 99.3% and on recognizing the facial expression, the recognition rate was 97.3%. The robot was then controlled autonomously with an accuracy of 100%. Combining the above three rates, the overall rate of success of our system was 97.3%.

No abstract

No abstract

Timetabling problem is known as an NP-hard problem that centres around finding an optimized allocation of subjects onto a finite available number of slots and spaces. It is perhaps the most challenging issues looked by colleges around the globe. Every academic institution faces a problem when preparing courses and exam plans. There are many restrictions raised while preparing a timetable. This paper proposed a method based on the evolutionary algorithms to solve the constrained timetable problem, which helps to create theory as well as lab schedule for universities. A smart adaptive mutation scheme is used to speed up convergence and chromosome format is also problem specific. Here in this paper two algorithms are compared in respect of Timetabling problems. Using GA (Genetic Algorithm) and MA (Memetic algorithm), we optimised the output by selecting the best solution from the available options to present a comprehensive curriculum system.

No abstract