Denumerable state stochastic games with limiting average payoff

We study stochastic games with countable state space, compact action spaces, and limiting average payoff. ForN-person games, the existence of an equilibrium in stationary strategies is established under a certain Liapunov stability condition. For two-person zero-sum games, the existence of a value and optimal strategies for both players are established under the same stability condition.

Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey

This work is a survey of the average cost control problem for discrete-time Markov processes. The authors have attempted to put together a comprehensive account of the considerable research on this problem over the past three decades. The exposition ranges from finite to Borel state and action spaces and includes a variety of methodologies to find and characterize optimal policies. The authors have included a brief historical perspective of the research efforts in this area and have compiled a substantial yet not exhaustive bibliography. The authors have also identified several important questions that are still open to investigation.

Average lattices and aperiodic structures

Statistically averaged lattices provide a common basis to understand the diffraction properties of structures displaying deviations from regular crystal structures. An average lattice is defined and examples are given in one and two dimensions along with their diffraction patterns. The absence of periodicity in reciprocal space corresponding to aperiodic structures is shown to arise out of different projected spacings that are irrationally related, when the grid points are projected along the chosen coordinate axes. It is shown that the projected length scales are important factors which determine the existence or absence of observable periodicity in the diffraction pattern more than the sequence of arrangement.

Variations in the copper(I)-copper(I) distances in multinuclear clusters with identical coordination geometries. Short metal-metal contacts induced by oligomerization

Factors contributing to the variations in the Cu(I)-Cu(I) distances in two clusters with identical ligand and coordination geometries have been analyzed. While the hexamer, 4, exhibits metal-metal distances in the range 2.81-3.25 Angstrom, shorter contacts are found in the corresponding tetramer, 3 (2.60-2.77 Angstrom). EHT calculations reveal relatively little attractive interactions in the corresponding Cu-4(4+) and Cu-6(6+) cores. Introduction of the ligands lowers the reduced overlap populations between the metals further. MNDO calculations with model electrophiles have been carried out to determine the bite angle requirements of the ligands. These are satisfactorily met in the structures of both 3 and 4. The key geometric feature distinguishing 3 and 4 is the Cu-S-Cu angle involving the bridging S- unit. In 4, the corresponding angles are about 90 degrees, while the values in 3 are smaller (70-73 degrees). Wider angles are computed to be energetically favored and are characterized by an open three-center bond and a long Cu-Cu distance. The bridging angles are suggested to be primarily constrained by the mode of oligomerization. Implications of these results for the stability and reactivity of these clusters and for short metal-metal distances in d(10) systems in general are discussed.

Propagating intensity disturbances in polar corona as seen from AIA/SDO

Context. Polar corona is often explored to find the energy source for the acceleration of the fast solar wind. Earlier observations show omni-presence of quasi-periodic disturbances, traveling outward, which is believed to be caused by the ubiquitous presence of outward propagating waves. These waves, mostly of compressional type, might provide the additional momentum and heat required for the fast solar wind acceleration. It has been conjectured that these disturbances are not due to waves but high speed plasma outflows, which are difficult to distinguish using the current available techniques. Aims. With the unprecedented high spatial and temporal resolution of AIA/SDO, we search for these quasi-periodic disturbances in both plume and interplume regions of the polar corona. We investigate their nature of propagation and search for a plausible interpretation. We also aim to study their multi-thermal nature by using three different coronal passbands of AIA. Methods. We chose several clean plume and interplume structures and studied the time evolution of specific channels by making artificial slits along them. Taking the average across the slits, space-time maps are constructed and then filtration techniques are applied to amplify the low-amplitude oscillations. To suppress the effect of fainter jets, we chose wider slits than usual. Results. In almost all the locations chosen, in both plume and interplume regions we find the presence of propagating quasi-periodic disturbances, of periodicities ranging from 10-30 min. These are clearly seen in two channels and in a few cases out to very large distances (approximate to 250 `') off-limb, almost to the edge of the AIA field of view. The propagation speeds are in the range of 100-170 km s(-1). The average speeds are different for different passbands and higher in interplume regions. Conclusions. Propagating disturbances are observed, even after removing the effects of jets and are insensitive to changes in slit width. This indicates that a coherent mechanism is involved. In addition, the observed propagation speed varies between the different passpands, implying that these quasi-periodic intensity disturbances are possibly due to magneto-acoustic waves. The propagation speeds in interplume region are higher than in the plume region.

Low-temperature structure of two copper-based precursors for MOCVD: Aquabis(tert-butyl acetoacetato)copper(II) and Bis(dipivaloylmethanido)copper(II)

The Cu atoms in aquabis(tert-butyl acetoacetato)copper(II),[Cu(C8H13O3)(2)(H2O)], and bis(dipivaloylmethanido)copper(II), [Cu(C11H19O2)(2)], adopt square-pyramidal and planar conformations, respectively, with average Cu--O distances of 1.933 Angstrom in the former (not including the water ligand) and 1.892 Angstrom in the latter. It is interesting to note that the lability of the tert-butyl and methyl groups in both structures, which renders even the location of the terminal C atoms difficult, is reduced at T = 130 K, enabling location of all the protons in the difference Fourier map.

Regular versus alternating (FeS4)(n) chains: Magnetism in KFeS2 and CsFeS2

We report crystal magnetic susceptibility results of two S = 1/2 one-dimensional Heisenberg antiferromagnets, KFeS2 and CsFeS2. Both compounds consist of (FeS4)(n) chains with an average Fe-Fe distance of 2.7 Angstrom. In KFeS2, all intrachain Fe-Fe distances are identical. Its magnetic susceptibility is typical of a regular antiferromagnetic chain with spin-spin exchange parameter J = -440.7 K. In CsFeS2, however, the Fe-Fe distances alternate between 2.61 and 2.82 Angstrom. This is reflected in its magnetic susceptibility, which could be fitted with J = -640 K, and the degree of alternation, alpha = 0.3. These compounds form a unique pair, and allow for a convenient experimental comparison of the magnetic properties of regular versus alternating Heisenberg chains.

Pyroelectric, ferroelectric and optical properties of glass nanocomposite: Lithium borate-bismuth tungstate

Glass nanocomposites in the system (1-x)Li2B4O7-xBi(2)WO(6) (0 less than or equal to x less than or equal to 0.35, in molar ratio) were fabricated by splat quenching technique. The as-quenched samples were X-ray amorphous. Differential Thermal Analyses (DTA) confirmed their glassy nature. The composites on heat-treatment at 720 K yielded monophasic crystalline bismuth tungstate in lithium borate glass matrix. The average size and the spherical nature of the dispersed crystallites were assessed via High Resolution Transmission Electron Microscopy (HRTEM). The dielectric constants (epsilon(r)) of both the as-quenched and post heat-treated composites were found to increase with increase in x (bismuth tungstate content) at all the frequencies (100 Hz-40 MHz) in the temperature range 300 K-870 K. While the dielectric loss (D) decreased with increasing x. The pyroelectric coefficients of the as-quenched (consisting 20 nm sized crystallites) and 720 K heat-treated sample (x = 0.3) were determined as a function of temperature (300 K-873 K) and the values obtained at room temperature were 20 and 60 muC/m(2) K respectively. The as-quenched and heat-treated (720 K) glass nanocomposites exhibited ferroelectric (P Vs E) hysteresis loops. The remnant polarization and coercive field of the heat-treated glass nanocomposite at 300 K were respectively 2.597 muC/cm(2) and 543 V/cm. These glass nanocomposites were birefringent in the 300-873 K temperature range.

Fault-Tolerant Average Execution Time Optimization for General Purpose Multi-Processor System-on Chips

Fault-tolerance is due to the semiconductor technology development important, not only for safety-critical systems but also for general-purpose (non-safety critical) systems. However, instead of guaranteeing that deadlines always are met, it is for general-purpose systems important to minimize the average execution time (AET) while ensuring fault-tolerance. For a given job and a soft (transient) error probability, we define mathematical formulas for AET that includes bus communication overhead for both voting (active replication) and rollback-recovery with checkpointing (RRC). And, for a given multi-processor system-on-chip (MPSoC), we define integer linear programming (ILP) models that minimize AET including bus communication overhead when: (1) selecting the number of checkpoints when using RRC, (2) finding the number of processors and job-to-processor assignment when using voting, and (3) defining fault-tolerance scheme (voting or RRC) per job and defining its usage for each job. Experiments demonstrate significant savings in AET.

An optimal weighted-average congestion based pricing scheme for enhanced QoS, , LNCS 4882, 2007

Pricing is an effective tool to control congestion and achieve quality of service (QoS) provisioning for multiple differentiated levels of service. In this paper, we consider the problem of pricing for congestion control in the case of a network of nodes under a single service class and multiple queues, and present a multi-layered pricing scheme. We propose an algorithm for finding the optimal state dependent price levels for individual queues, at each node. The pricing policy used depends on a weighted average queue length at each node. This helps in reducing frequent price variations and is in the spirit of the random early detection (RED) mechanism used in TCP/IP networks. We observe in our numerical results a considerable improvement in performance using our scheme over that of a recently proposed related scheme in terms of both throughput and delay performance. In particular, our approach exhibits a throughput improvement in the range of 34 to 69 percent in all cases studied (over all routes) over the above scheme.

Faster algorithms for all-pairs small stretch distances in weighted graphs

Abstract. Let G = (V,E) be a weighted undirected graph, with non-negative edge weights. We consider the problem of efficiently computing approximate distances between all pairs of vertices in G. While many efficient algorithms are known for this problem in unweighted graphs, not many results are known for this problem in weighted graphs. Zwick [14] showed that for any fixed ε> 0, stretch 1 1 + ε distances between all pairs of vertices in a weighted directed graph on n vertices can be computed in Õ(n ω) time, where ω < 2.376 is the exponent of matrix multiplication and n is the number of vertices. It is known that finding distances of stretch less than 2 between all pairs of vertices in G is at least as hard as Boolean matrix multiplication of two n×n matrices. It is also known that all-pairs stretch 3 distances can be computed in Õ(n 2) time and all-pairs stretch 7/3 distances can be computed in Õ(n 7/3) time. Here we consider efficient algorithms for the problem of computing all-pairs stretch (2+ε) distances in G, for any 0 < ε < 1. We show that all pairs stretch (2 + ε) distances for any fixed ε> 0 in G can be computed in expected time O(n 9/4 logn). This algorithm uses a fast rectangular matrix multiplication subroutine. We also present a combinatorial algorithm (that is, it does not use fast matrix multiplication) with expected running time O(n 9/4) for computing all-pairs stretch 5/2 distances in G. 1