Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

Department of Database Systems

School of Computer Science and Engineering

Vellore Campus

VIT Unitversity

Department of Bio-Medical Sciences

School of Bio Sciences and Technology

Research Journal of Pharmacy and Technology

A Study on Marine Lipolytic Yeasts: Optimization and Characterization of Lipase Enzyme

The concept of neutrosophy and indeterminacy I was introduced by Smarandache, to deal with neutralies. Since then the notions of neutrosophic rings, neutrosophic semigroups and other algebraic structures have been developed. Neutrosophic duplets and their properties were introduced by Florentin and other researchers have pursued this study.In this paper authors determine the neutrosophic duplets in neutrosophic rings of characteristic zero. The neutrosophic duplets of 〈Z ∪ I〉, 〈Q∪I〉 and 〈R∪I〉 the neutrosophic ring of integers, neutrosophic ring of rationals and neutrosophic ring of reals respectively have been analysed. It is proved the collection of neutrosophic duplets happens to be infinite in number in these neutrosophic rings. Further the collection enjoys a nice algebraic structure like a neutrosophic subring, in case of the duplets collection a-aI|a ∈ Z for which 1-I acts as the neutral. For the other type of neutrosophic duplet pairs a - aI, 1 - dI where a ∈ R+ and d ∈ R, this collection under component wise multiplication forms a neutrosophic semigroup. Several other interesting algebraic properties enjoyed by them are obtained in this paper. © 2018 Neutrosophic Sets and Systems.

World University root node

Neutrosophic Sets and Systems

Algebraic structure of neutrosophic duplets in neutrosophic rings 〈Z ∪ I〉, 〈Q ∪ I〉 and 〈R ∪ I〉

This paper aims to develop the round-robin (RR) process scheduling algorithm, to get optimized waiting and turnaround time with less number of context switching for the given process. RR algorithm is the most adopted algorithm in modern computing as it overcomes the problem of starvation in first-come first-serve (FCFS) and short job first (SJF). In this article, an improved round-robin algorithm is proposed by calculating the mean of the given processes namely Check Mean with round-robin (CMRR), which reduces the average waiting time (AWT) and average turnaround time (ATT) of the given processes. The drawback of the present round-robin algorithm is that it turns to FCFS in case of large time quantum values which results in higher waiting and turnaround time of the processes. This method gives the most optimized values for scheduling the given processes reducing waiting and turnaround time comparatively. This method is more efficient if the processes burst time is in ascending order. It also reduces the number of context switches increasing the throughput.

Department of Software Systems

System and Architecture Advances in Intelligent Systems and Computing

A New CPU Scheduling Algorithm Using Round-robin and Mean of the Processes

Social cloud is a new paradigm which allows a user to share the system resources for computing purposes when it is not being used. This paper focuses on the social cloud where the computing nodes are managed by the social bonds determined from a social graph. Whenever a task is given by a user, the burden of computing is passed to the friend to whom he is connected directly in the social network. We have proposed a new index called trust index for calculating the trust value of a user and also to find out whether a user is trustworthy or not. Trust index helps to verify a friend in a social network and make them trustworthy. Trust based scheduling is done using FCFS and round robin and shown that the performance of round robin is better than FIFO in social cloud. Copyright © 2018 Inderscience Enterprises Ltd.

International Journal of Reasoning-based Intelligent Systems

Trusted computing in social cloud

Lecture Notes on Data Engineering and Communications Technologies

Preface

This research work which initiated at an early detection of all the probable symptoms and signs which might further lead to detection of cardiac diseases using data collected from previous patients as well as data input received from the user at that particular time. Current scenario of health-care data used for surveillance are no longer simply a time building series of aggregate daily counts. Instead, a wealth of proposed spatial as well as temporal demographic, and symptom information is available at the data presented during the time of execution. Our proposed method incorporates all such information that is being used as a classification approach that compares recent healthcare data against data from that particular baseline distribution and hence classifies subgroups of the given data. In addition, the data sample data used is first tested against many types of classifiers and various other proposed test scores have been evaluated. Test best is further chosen to make predictions. This follows a prototype implementation using a python based data mining tool, Orange (version: 0.17.1). The database can be stored in a cloud to centralize it and make access easier. © 2018 IEEE.

2018 Second International Conference on Inventive Communication and Computational Technologies (ICICCT)

Prediction of Cardiac Disease Based on Patient's Symptoms

Due to advancement in technology, a huge volume of data is generated. Extracting knowledgeable data from this voluminous information is a difficult task. Therefore, machine learning techniques like classification, clustering, information retrieval, feature selection and data analysis has become core of recent research. These techniques can also be solved using Nature Inspired Algorithms. Nature Inspired Algorithms is inspired by processes, observed from nature. Feature Selection is helpful in finding subset of prominent components to enhance prescient precision and to expel the excess features. This chapter surveys seven nature inspired algorithms, namely Particle Swarm Optimization, Ant Colony Optimization Algorithms, Artificial Bees Colony Algorithms, Firefly Algorithms, Bat Algorithms, Cuckoo Search and Genetic Algorithms and its application in feature selections. The significance of this chapter is to present comprehensive review of nature inspired algorithms to be applied in feature selections.

Department of Structural and Geotechical Engineering

School of Civil Engineering

Advances in Computational Intelligence and Robotics Handbook of Research on Modeling, Analysis, and Application of Nature-Inspired Metaheuristic Algorithms

A Comprehensive Review of Nature-Inspired Algorithms for Feature Selection

Context aware applications are seeking for the technologies that provides regularly available data between internal and external environments. Wireless access infrastructure is integrating real time data and heterogeneous devices to establish ubiquitous communication. A wireless sensor network (WSN) is primarily undertaking remote monitoring of any task in any sensing field further to extend for context fetching and refining to collect essential context information for pervasive environment. The applications are well utilized on context observation and interpretation for mobile users. The proposed method assists to combine various basic low level contexts to provide reliable decision making in the pervasive environment using sensor networks and context aware computing. Pervasive computing has powerful and influencing factors to establish dynamic and smart environment with its dominant features in the backend. Pervasiveness provides the regulated smart interactions and interfaces together to avail the information for various applications. Using rich context for event notification than simple position and time, aim to bring automated decision along with accuracy information. The proposed model also facilitate users and group members to create and submit an event. It provides ability to submit an event using a various mode of input. © 2018 The Authors. Published by Elsevier Ltd.

Fulltext

Procedia Computer Science

Contexts enabled Decision Making using sensors to perceive pervasive environment

Many researchers developed several routing techniques to reduce the power consumption of the nodes without decreasing capacity of the network, to increase life time of the network while preserving the connectivity of nodes. A routing protocol is presented in this paper that reduces overall energy consumption of nodes in the mobile ad hoc networks. This routing protocol focuses on energy conservation and also it provides some of the necessary quality of services in routing such as throughput, packet delivery ratio and less error rate. This routing protocol utilises the bandwidth of the network effectively and finds the minimum energy consuming path that has less error rate. Recharging capability of the nodes is taken into consideration while computing minimal energy consuming path from source to destination. The protocol is simulated for various network parameters using a network simulator. The performance of proposed protocol is evaluated by comparing the simulation results with the results of one of the popular routing protocols such as DSR. Copyright © 2018 Inderscience Enterprises Ltd.

International Journal of Communication Networks and Distributed Systems

Energy efficient QoS routing for mobile ad hoc networks

Designing for a Digital and Globalized World Lecture Notes in Computer Science

Dengue Prediction Using Hierarchical Clustering Methods