We propose a novel algorithm for the capacitated passenger assignment problem in public transportation where priority lists define the order in which passengers are assigned. The originality of our approach is to define the priority rules exogenously. Separating explicitly theses rules from the assignment procedure allows for a great deal of flexibility to model various priority rules. Computat...

Let n ≥ 2, and let M1 and M2 be two smooth n − 1-dimensional manifolds, each containing a preferred origin 0M1 and 0M2 . We shall abuse notation and write 0 for both 0M1 and 0M2 . For the purposes of integration we shall place a smooth Riemannian metric on M1 and M2, although the exact choice of this metric will not be relevant. All our considerations shall be local to the origin 0. We are inte...

This paper focuses on a narrow band technical solution that uses decentralized spectrum sharing to facilitate open access among competing Personal Communications Services (PCS) operators. Existing policies that apportion spectrum by Fixed Channel Assignment (FCA) involve inefficiencies resulting from fragmentation of the available resource into mutually exclusive frequency blocks. Dynamic Chann...

Application Speciic Programmable Processors (ASPP) provide eecient implementation for any of k speciied functionalities. Using the exibility provided by multiple functionalities we have developed a novel approach for permanent fault-tolerance called Heterogeneous Built-In-Resiliency (HBIR). The proposed HBIR technique combines the exibility provided by multiple functionalities with judicious op...

One of the basic combinatorial optimization problems is the assignment problem that deals with assigning jobs to individuals. In traditional assignment problems, n jobs usually assign to n individuals such that the total cost is minimized or the total profit is maximized. However, in numerous real-life applications, various attributes could be considered in assignment problems while data (obj...

It may be that there is no way to axiomatize an intensional logic without recourse to one or more iterative axioms; then I call that logic iterative. But many familiar logics can be axiomatized by means of non-iterative axioms alone; these logics I call non-iterative. A frame, roughly speaking, is a partial interpretation for an intensional language. It provides a set 1, all subsets of which ar...

this paper presents characterizations of m-fuzzifying matroids bymeans of two kinds of fuzzy operators, called m-fuzzifying derived operatorsand m-fuzzifying difference derived operators.

we characterize compact composition operators on real banach spaces of complex-valued bounded lipschitz functions on metric spaces, not necessarily compact, with lipschitz involutions and determine their spectra.

‎in this short note‎, ‎we present some inequalities for relative operator entropy which are generalizations of some results obtained by zou [operator inequalities associated with tsallis relative operator entropy‎, ‎{em math‎. ‎inequal‎. ‎appl.}‎ ‎{18} (2015)‎, ‎no‎. ‎2‎, ‎401--406]‎. ‎meanwhile‎, ‎we also show some new lower and upper bounds for relative operator entropy and tsallis relative o...