The existence of sensitive optimal policies in two multi-dimensional queueing models

Recently Dekker and Hordijk [3,4] introduced conditions for the existence of deterministic Blackwell optimal policies in denumerable Markov decision chains with unbounded rewards. These conditions include- uniform geometric recurrence.The-uniform geometric recurrence property also implies the existence of average optimal policies, a solution to the average optimality equation with explicit formula's and convergence of the value iteration algorithm for average rewards. For this reason, the verification of-uniform geometric convergence is also useful in cases where average and-discounted rewards are considered.On the other hand,-uniform geometric recurrence is a heavy condition on the Markov decision chain structure for negative dynamic programming problems. The verification of-uniform geometric recurrence for the Markov chain induced by some deterministic policy together with results by Sennott [14] yields the existence of a deterministic policy that minimizes the expected average cost for non-negative immediate cost functions.In this paper-uniform geometric recurrence will be proved for two queueing models: theK competing queues and the two centre open Jackson network with control of the service rates.The research of the author is supported by the Netherlands Organization for Scientific Research N.W.O.     

Chip-Firing Games on Directed Graphs

We consider the following (solitary) game: each node of a directed graph contains a pile of chips. A move consists of selecting a node with at least as many chips as its outdegree, and sending one chip along each outgoing edge to its neighbors. We extend to directed graphs several results on the undirected version obtained earlier by the authors, P. Shor, and G. Tardos, and we discuss some new topics such as periodicity, reachability, and probabilistic aspects.Among the new results specifically concerning digraphs, we relate the length of the shortest period of an infinite game to the length of the longest terminating game, and also to the access time of random walks on the same graph. These questions involve a study of the Laplace operator for directed graphs. We show that for many graphs, in particular for undirected graphs, the problem whether a given position of the chips can be reached from the initial position is polynomial time solvable.Finally, we show how the basic properties of the probabilistic abacus can be derived from our results.     

Application of ammonia intermittent temperature-programmed desorption to evaluate surface acidity of tungsten oxide supported on activated carbon

Intermittent temperature-programmed desorption of ammonia was used to study the strength and population of surface acid sites of tungsten oxide supported on activated carbon pretreated at 350 and 700 degrees C. Catalysts pretreated at 350 degrees C showed two types of surface acid sites and desorption occurred with free readsorption until a temperature of around 300 degrees C was reached. Pretreatment at 700 degrees C produced three different states of ammonia adsorbed on the catalysts and desorption occurred with free readsorption.     

Rh(I)-catalyzed Pauson-Khand reaction of 1-phenylsulfonyl-1,2-octadien-7-yne derivatives

The Rh(I)-catalyzed PKR of 1-phenylsulfonyl-1,2-octadien-7-ynes and their aza derivatives exclusively produced the corresponding 9-phenylsulfonylbicyclo[4.3.0]nona-1,6-dien-8-ones and no 4-(phenylsulfonylmethylidene)bicyclo[3.3.0]oct-1-en-3-ones could be detected. Thus, the ring-closing pattern was found to be the same as those of the previously reported 3-phenylsulfonyl-1,2-octadien-7-yne derivatives. However, the formation of 4-(phenylsulfonylmethylidene)-7-oxabicyclo[3.3.0]oct-1-en-3-ones was observed as a minor product when the 5-oxa congeners were used. In addition, a larger ring-sized product, 10-phenylsulfonyl-5-azabicyclo[5.3.0]deca-1,7-dien-9-one derivative, was obtained from the 6-aza derivative of 1-phenylsulfonyl-1,2-nonadien-8-yne.     

Über diskrete alternierende entseheidungsprozesse

A stationary altering Markovian decision model (SAMDM) with the discrete state and action spaces is defined and investigated. It is a special non-stationary MDM in which the characteristics of the model reiterate in two periods. Methods for solving stationary Markovian decision problems are modified for SAMDM.     

基于支持向量机的凝血功能诊断模型

使用凝血四项指标诊断凝血功能是临床的常规检查,但根据经验进行诊断正确率不高.剔除临床上最重要的指标FIB后,建立支持向量机模型诊断的正确率和根据凝血四项指标诊断的正确率没有显著差异,100次模拟的平均正确率分别达到了95.4496%和95.5039%.     

α‐ZrP/Uracil/Cu2+ nanoparticles as an efficient catalyst in the Morita‐Baylis‐Hillman reaction

A facile synthesis of uracil‐Cu²⁺ nanoparticles immobilized on alpha‐zirconium hydrogen phosphate (α‐ZrP), abbreviated as α‐ZrP/Uracil/Cu²⁺, was presented. This compound was synthesized by the thermal method and used as a reusable catalyst for the Morita‐Baylis‐Hillman reaction without any additives. First, (3‐ iodopropyl) trimethoxysilane as a linker is reacted with α‐ZrP support to give the α‐ZrP/IPTMOS. Addition of uracil and then the addition of copper (II) acetate to α‐ZrP/IPTMOS results in the production of selected catalyst. The Morita‐Baylis‐Hillman reaction catalyzed by α‐ZrP/Uracil/Cu^{2 +} demonstrated high product yield, short reaction time and a straightforward work‐up. The catalyst with enough outside surface was easily recovered using centrifugation and reused five times without a significant reduction in its activity.     

Fly‐Ash‐Supported Synthesis of 2‐Mercaptobenzothiazole Derivatives under Microwave Irradiation

Microwave‐assisted, solvent‐free alkylation and acylation of 2‐mercaptobenzothiazole has been attempted using silica gel, alumina, and a new solid support, fly ash. Fly ash, a waste generated at thermal power stations, could be used as solid support just as efficiently as commercial supports. The additional features of methodology include a much faster reaction, easy workup, higher yields, higher purity of the products, and an ecofriendly approach.