We investigate a model for buffer management of multi-class traffic into a finite shared buffer. A hierarchy of increasingly stronger linear programming relaxations for this model is proposed. The number of hierarchies equals the number of job classes. Each relaxation in the hierarchy is constructed by projecting the original achievable performance region into a polytope with fewer variables an...

Motivation is a key factor in human learning. We learn best when we are highly motivated to learn. Psychologists distinguish between extrinsically-motivated behavior, which is behavior undertaken to achieve some externally supplied reward, such as a prize, a high grade, or a high-paying job, and intrinsically-motivated behavior, which is behavior done for its own sake. Is there an analogous dis...

We study the complexity theory for the local distributed setting introduced by Korman, Peleg and Fraigniaud in their seminal paper [3]. They have defined three complexity classes LD (Local Decision), NLD (Nondeterministic Local Decision) and NLD. The class LD consists of all languages which can be decided with a constant number of communication rounds. The class NLD consists of all languages wh...

The current study aims to deeply analyze the influence of various hierarchies within police department on Quality Work Life. specific focus is Police Telecom Branch Madhya Pradesh Police. primary goal this research delve into how personnel different ranks perceive their quality work life. It seeks pinpoint dimensions where perceptions significantly vary. By doing so, understand these impact per...

A common property of practically all multi-party key agreement protocols is that they are non-hierarchical, i.e., they do not support user hierarchies. However, in real life it is likely that members of groups and organizations differ in ranking according to their job positions. Thus, it is reasonable that participants of a certain ranking could access more privileged information than participa...

Many studies of interactive environments of object-oriented databases are based on extensions to declarative query languages, designed for relational databases. Such environments do not use well the characteristics of the object-oriented databases. In this paper, we introduce an environment that allows users to construct tailored class hierarchies, which represent both the users’ views and the ...

We consider the problem of finding routes in road networks that optimize a combination of travel time and additional time-invariant costs. These could be an approximation of energy consumption, distance, tolls, or other penalties. The resulting problem is NP-hard, but if the additional cost is proportional to driving distance we can solve it optimally on the German road network within 2.3 s usi...

This thesis is concerned with a so-called speedup technique for Dijkstra’s algorithm: Contraction hierarchies. We present a model of contraction hierachies sufficiently sophisticated to capture real-world applications but yet concise enough to lend itself to theoretical investigations. This model reveals an interrelation between contraction hierarchies and filled graphs that directly relates th...

We consider multicriteria shortest path problems and show that contraction hierarchies – a very powerful speed-up technique originally developed for standard shortest path queries in [7] – can be constructed efficiently for the case of arbitrary conic combinations of the edge costs. This extends previous results in [5] which considered only the bicriteria case and discrete weights for the objec...

Time-dependent Contraction Hierarchies provide fast and exact route planning for time-dependent large scale road networks but need lots of space. We solve this problem by the careful use of approximations of piecewise linear functions. This way we need about an order of magnitude less space while preserving exactness and accepting only a little slow down. Moreover, we use these approximations t...