In the markdown case, the firm has to consecutively charge the sequence of decreasing prices p̄K , p̄K−1, ..., p̄0. Again, we aim at showing the optimality of a threshold policy τ = (τk n | k = 1, 2, ...,K, n = 1, 2, ..., N) ∈ (∆N )K . Under this policy, the firm should lower its price from p̄k to p̄k−1 when the threshold time τk n corresponding to its current inventory level n is about to be passed...

10 technique enables a simple cost-eeective implementation with little eeort. It was used for the rst time to implement a fast optimal parallel hashing algorithm 7]. The hashing algorithm in 7] comprises two parts: the rst part is a randomized geometric decaying algorithm which runs for O(lg lg n) steps. By using the technique of this paper and the O(lg lg n) time load balancing of 6], this par...

BACKGROUND To bring down its high maternal mortality ratio, Burkina Faso adopted a national health policy in 2007 that designed to boost the assisted delivery rate and improving quality of emergency obstetrical and neonatal care. The cost of transportation from health centres to district hospitals is paid by the policy. The worst-off are exempted from all fees. METHODS The objectives of this ...

This article aims to systematize and analyze social data that reveal the dimension of racial inequalities in Brazil. The point of departure is that racial inequalities affect the capacity for integration of Blacks into Brazilian society and jeopardize the proposal to build a democratic society with equal opportunities for all. Such inequalities are present at different moments in the individual...

We examine a replacement system with discrete-time Markovian deterioration and finite state space {0, ..., N}. State 0 stands for a new system, and the higher the state the worse the system; a system in state N is considered to be in a bad state. We impose the condition that the fraction of replacements in state N should not be larger than some fixed number. We prove that a generalized control ...

We present an overview of scalable load balancing algorithms which provide favorable delay performance in large-scale systems, and yet only require minimal implementation overhead. Aimed at a broad audience, the paper starts with an introduction to the basic load balancing scenario – referred to as the supermarket model – consisting of a single dispatcher where tasks arrive that must immediatel...

A multi-class M/M/1 system, with service rate μin for class-i customers, is considered with the risk-sensitive cost criterion n−1 logE exp ∑ i ciX n i (T ), where ci > 0, T > 0 are constants, andX i (t) denotes the class-i queue-length at time t, assuming the system starts empty. An asymptotic upper bound (as n→ ∞) on the performance under a fixed priority policy is attained, implying that the ...

BACKGROUND This study aims to determine the nature of United States Institutional Review Board (IRB) policy in a broad spectrum of research settings regarding the return of results to study participants. METHOD IRB policies or standard operating procedures of 207 Medical School, Industry and Non-medical School IRBs were examined on-line to determine if they incorporated specific reference to ...

This paper presents the effects of a free-repair warranty on the periodic replacement policy in discrete time process. Consider a repairable product that should be operating at the time over an indefinitely long operation cycle n (     , 2 , 1 n ); under the discrete-time periodic replacement policy, a product is preventively replaced at pre-specified operation cycles    , 3 , 2 , N N N ...

 Let $R$ be a ring‎, ‎and let $n‎, ‎d$ be non-negative integers‎. ‎A right $R$-module $M$ is called $(n‎, ‎d)$-projective if $Ext^{d+1}_R(M‎, ‎A)=0$ for every $n$-copresented right $R$-module $A$‎. ‎$R$ is called right $n$-cocoherent if every $n$-copresented right $R$-module is $(n+1)$-coprese-nted‎, ‎it is called a right co-$(n,d)$-ring if every right $R$-module is $(n‎, ‎d)$-projective‎. ‎$R$...