The inefficiency of polynomial-time ( PTIME ) algorithms in the context big data indicates a departure from traditional view on tractability. In recent years, sublinear-time have been regarded as new standard for tractability computing problems. Based prior work complexity classes [1] , this paper focuses designing appropriate reductions specialized particular, series pseudo-sublinear-time are ...

Two very different articles in this issue deal with the same important subject: workflow redesign. It’s a topic that is at the same time important and often slighted, largely because workflow – the way we do what we do day after day – tends to become such a well-traveled route that we may forget that other ways may lead us to the same end more quickly and efficiently. When workflow issues do ...

This paper investigates cost and profit efficiency of German hospitals. More specifically, it deals with the question how hospital efficiency varies with ownership, patient structure, and other exogenous factors, which are neither inputs nor outputs of the production process. We conduct a Stochastic Frontier Analysis (SFA) on a multifaceted administrative German dataset combined with the balanc...

There is increasing interest in fully ranking the performance of organizational units with multiple inputs and outputs. We smooth the congenital differences of efficient and inefficient units. The concept of the secondary frontier is to eliminate the effects of super-efficiency and inefficiency. The pseudo secondary frontier is constructed to lie between the efficient and inefficient units. Lo...

Until recently, the common approach to using Flash memory technology in embedded devices has been to use a pseudo-filesystem on the flash chips to emulate a standard block device and provide wear levelling, and to use a normal file system on top of that emulated block device. JFFS is a log-structured file system designed by Axis Communications AB in Sweden specifically for use on flash devices ...

the aim of this paper is to generalize the‎‎notion of pseudo-almost valuation domains to arbitrary‎ ‎commutative rings‎. ‎it is shown that the classes of chained rings‎ ‎and pseudo-valuation rings are properly contained in the class of‎ ‎pseudo-almost valuation rings; also the class of pseudo-almost‎ ‎valuation rings is properly contained in the class of quasi-local‎ ‎rings with linearly ordere...

It is well-known that the naive bootstrap yields inconsistent inference in the context of data envelopment analysis (DEA) or free disposal hull (FDH) estimators in nonparametric frontier models. For inference about efficiency of a single, fixed point, drawing bootstrap pseudo-samples of size m < n provides consistent inference, although coverages are quite sensitive to the choice of subsample s...

We present a short, geometric proof for the price-of-anarchy results that have recently been established in a series of papers on selfish routing in multicommodity flow networks and on nonatomic congestion games. This novel proof also facilitates two new types of theoretical results: On the one hand, we give pseudo-approximation results that depend on the class of allowable cost functions. On t...

This paper describes slab geometry studies of the difference formulation based on the original P0 formulation and a new P1 formulation. Hybrid schemes are presented, which combine the best features of the intensity and difference formulations. The aim is to design an optimal algorithm for general Monte Carlo radiation transport problems, suitable for use with both IMC and SIMC temporal discreti...

Distributed Constraint Optimization Problem (DCOP) has emerged as one of most important formalisms for distributed reasoning in multiagent systems. Nevertheless, there are few real world applications based on methods for solving DCOP, due to their inefficiency in some scenarios. This paper introduces the use of Social Network Analysis (SNA) techniques to improve the performance in pseudo-tree-b...