In this paper, a classifier based on the positive Boolean function(PBF) is proposed for the supervised pattern classification. A PBF is exactly represented as one sum-of-product form without any negative components. The PBF possesses the well-known threshold decomposition and stacking properties. The classification errors can be calculated from the summation of the absolute errors incurred at e...

This thesis is divided into two parts. The first part of the thesis deals with the study of heuristic based approaches for approximating Pareto fronts. We propose a new Double Archive Pareto local search algorithm for solving multi-objective combinatorial optimization problems. We embed our technique into a genetic framework where our algorithm restarts with the set of new solutions formed by t...

Preemptive kidney transplantation, as a treatment modality for end-stage renal disease, offers higher clinical advantages compared to maintenance dialysis. Nevertheless, preemptive transplantations raises ethical concerns, particularly regarding medical resource allocation. From an ethical perspective, health care decisions should be focused on the patient's needs. Nevertheless, a fair distribu...

Edge-finding bounding techniques are particular constraint propagation techniques which reason about the order in which several activities can execute on a given resource. The aim of the following paper is to provide a rather comprehensive (although necessarily incomplete) review of existing edge-finding algorithms. The simplest case of non-preemptive disjunctive scheduling is reviewed first, f...

BACKGROUND mu-Opioid receptor agonists are strong analgesics. However, their usefulness for preemptive analgesia is controversial. The authors tested antinociceptive and preemptive properties of fentanyl as a mu-opioid receptor agonist in a model of spinal nociception in vivo. METHODS C fiber-evoked potentials were recorded in the superficial laminae I-II of the rat lumbar spinal cord with gl...

While it is widely believed that preemptability is a necessary requirement for developing real-time software, there are additional costs involved with preemptive scheduling, as compared to non-preemptive scheduling. Furthermore, in the context of fixed-priority scheduling, feasibility of a task set with nonpreemptive scheduling does not imply feasibility with preemptive scheduling (and vice-ver...

The present investigation deals with performance analysis of single server preemptive priority retrial queue with immediate Bernoulli feedback. There are two types of customers are considered, which are priority customers and ordinary customers. The priority customers do not form any queue and have an exclusive preemptive priority to receive their services over ordinary customers. After complet...

This study presents a non-preemptive priority queue model to approximate the cell delay of a multi-channel slotted ring network with a single tunable transmitter and ®xed receiver, and one queue for storing cells for each channel at each node. To analyze network performance, this network is translated to the proposed non-preemptive priority queue model. With this model, the analytical cell-dela...