Bio: K. Indhira is an academic researcher from VIT University. The author has contributed to research in topics: Queue & Service (business). The author has an hindex of 3, co-authored 23 publications receiving 33 citations.
TL;DR: The aim of the paper is to investigate the relationship between BCK/BCIalgebras and other alge Bras namely d-alge bras, Q-alGEbras-BCH- algebrAs- TM-al Geometric System, and to introduce some algebraic system.
Abstract: The aim of the paper is to investigate the relationship between BCK/BCIalgebras and other algebras namely d-algebras, Q-algebras-BCH-algebras- TM-algebras-INK-algebras and we introduce some algebraic system.
TL;DR: This work considered interactive telemedicine as a queueing system and analyzed it by using the method of supplementary variables, obtained the performance measures through a probability generating function and found the numerical results of the queueingSystem may be useful to provide service satisfactorily and update the utility function of interactive teleMedicine.
01 Nov 2017
TL;DR: In this paper, the authors define the notation of INK-algebra-ideal, fuzzy set, intuitionistic fuzzy K-ideals and intuitionistic closed Kideals in INK algebras and prove some theorems which show some relationships between these notation.
TL;DR: The concept of T-normed fuzzy TM-subalgebras is introduced by applying the notion of t-norm to fuzzyTM-algebra and its properties are investigated and the ideas based on minimum t- norm are generalized to all widely accepted t- norms in a fuzzy TMsubalgebra.
Abstract: The concept of T-normed fuzzy TM-subalgebras is introduced by applying the notion of t-norm to fuzzy TM-algebra and its properties are investigated. The ideas based on minimum t-norm are generalized to all widely accepted t-norms in a fuzzy TMsubalgebra.The characteristics of an idempotent T-normed fuzzy TM-subalgebra are studied. The properties of image and the inverse image of a T-normed fuzzy TM-subalgebra under homomorphism is discussed. The T-direct product and T-product of T-normed fuzzy TM-subalgebras are also considered.
••01 May 1975
TL;DR: The Fundamentals of Queueing Theory, Fourth Edition as discussed by the authors provides a comprehensive overview of simple and more advanced queuing models, with a self-contained presentation of key concepts and formulae.
Abstract: Praise for the Third Edition: "This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented."IIE Transactions on Operations EngineeringThoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than presenting a narrow focus on the subject, this update illustrates the wide-reaching, fundamental concepts in queueing theory and its applications to diverse areas such as computer science, engineering, business, and operations research.This update takes a numerical approach to understanding and making probable estimations relating to queues, with a comprehensive outline of simple and more advanced queueing models. Newly featured topics of the Fourth Edition include:Retrial queuesApproximations for queueing networksNumerical inversion of transformsDetermining the appropriate number of servers to balance quality and cost of serviceEach chapter provides a self-contained presentation of key concepts and formulae, allowing readers to work with each section independently, while a summary table at the end of the book outlines the types of queues that have been discussed and their results. In addition, two new appendices have been added, discussing transforms and generating functions as well as the fundamentals of differential and difference equations. New examples are now included along with problems that incorporate QtsPlus software, which is freely available via the book's related Web site.With its accessible style and wealth of real-world examples, Fundamentals of Queueing Theory, Fourth Edition is an ideal book for courses on queueing theory at the upper-undergraduate and graduate levels. It is also a valuable resource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.
TL;DR: An overview and literature survey on the performance modeling and analysis of single server, general service queueing system with service interruption using supplementary variable technique and factors causing service interruption such as unreliable server and server vacation are presented.
Abstract: In most of the queueing models, service is considered to be complete without any interruption. But in reality, queueing systems are subject to interruptions due to failure of server or any other cause. In the present article, we present an overview and literature survey on the performance modeling and analysis of single server, general service queueing system with service interruption using supplementary variable technique. The factors causing service interruption such as unreliable server and server vacation are elaborated. The brief of supplementary variable technique to establish the queue size distribution is explained for single server non-Markovian queueing models by incorporating the features of service interruption. The basic concepts and review of literature on the queues with server breakdown and/or vacationing server are described. The research works done during last 10 years (2010–2019) on queues with service interruption involving many other key concepts namely Bernoulli vacation, multiple vacation, bulk arrival, discouragement, etc. and queueing scenarios of service interruption are reported. Some specific applications are also highlighted.
TL;DR: The proposed telemedicine framework trained through Bagging and Boosting classifiers (Improved Random Forest, AdaBoost, Gradient Boosting algorithm) with an extracted set of handcrafted features achieved phenomenal performance in recognizing respiratory pathology.
TL;DR: This paper considers a single server queueing model with under general bulk service rule with infinite upper bound on the batch size which it is called group clearance .
Abstract: In this paper we consider a single server queueing model with under general bulk service rule with infinite upper bound on the batch size which we call group clearance. The arrivals occur according to a batch Markovian point process and the services are generally distributed. The customers arriving after the service initiation cannot enter the ongoing service. The service time is independent on the batch size. First, we employ the classical embedded Markov renewal process approach to study the model. Secondly, under the assumption that the services are of phase type, we study the model as a continuous-time Markov chain whose generator has a very special structure. Using matrix-analytic methods we study the model in steady-state and discuss some special cases of the model as well as representative numerical examples covering a wide range of service time distributions such as constant, uniform, Weibull, and phase type.
TL;DR: An intelligent traffic model is formalized and presented to control multiple traffic light simultaneously and efficiently according to the distribution of vehicles from each incoming link according to a game theoretical framework in this paper.
Abstract: Many traffic models and control methods have already been utilized in the public transportation system due to the increasing traffic congestion. Thus, an intelligent traffic model is formalized and presented to control multiple traffic light simultaneously and efficiently according to the distribution of vehicles from each incoming link (i.e. sections) in this paper. Compared with constant strategy, two methods are proposed for traffic light control, i.e., game theoretical strategy and reinforcement learning methods. Game theoretical strategy is generated in a game theoretical framework where incoming links are regarded as players and the combination of the status of traffic lights can be regarded as decisions made by these players. The cost function is evaluated and the strategy is produced with Nash equilibrium for passing maximum vehicles in an intersection. The other one is Single-Agent Reinforcement Learning (SARL), specifically with the Q-learning algorithm in this case, which is usually used in such a dynamic environment to control traffic flow so the traffic problem could be improved. Generally, the intersection is regarded as the centralized agent and controlling signal status is considered as the actions of the agent. The performance of these two methods is compared after simulated and implemented in a junction.