199 resultados para lump sum
Resumo:
A new approach based on occupation measures is introduced for studying stochastic differential games. For two-person zero-sum games, the existence of values and optimal strategies for both players is established for various payoff criteria. ForN-person games, the existence of equilibria in Markov strategies is established for various cases.
Resumo:
For d >= 2, Walkup's class K (d) consists of the d-dimensional simplicial complexes all whose vertex-links are stacked (d - 1)-spheres. Kalai showed that for d >= 4, all connected members of K (d) are obtained from stacked d-spheres by finitely many elementary handle additions. According to a result of Walkup, the face vector of any triangulated 4-manifold X with Euler characteristic chi satisfies f(1) >= 5f(0) - 15/2 chi, with equality only for X is an element of K(4). Kuhnel observed that this implies f(0)(f(0) - 11) >= -15 chi, with equality only for 2-neighborly members of K(4). Kuhnel also asked if there is a triangulated 4-manifold with f(0) = 15, chi = -4 (attaining equality in his lower bound). In this paper, guided by Kalai's theorem, we show that indeed there is such a triangulation. It triangulates the connected sum of three copies of the twisted sphere product S-3 (sic) S-1. Because of Kuhnel's inequality, the given triangulation of this manifold is a vertex-minimal triangulation. By a recent result of Effenberger, the triangulation constructed here is tight. Apart from the neighborly 2-manifolds and the infinite family of (2d + 3)-vertex sphere products Sd-1 X S-1 (twisted for d odd), only fourteen tight triangulated manifolds were known so far. The present construction yields a new member of this sporadic family. We also present a self-contained proof of Kalai's result. (C) 2011 Elsevier B.V. All rights reserved.
Resumo:
A detailed theoretical study of solvation dynamics in water is presented. The motivation of the present study comes from the recent experimental observation that the dynamics of solvation of an ion in water is ultrafast and the solvation time correlation function decays with a time constant of about 55 fs. The slower decay in the long time can be described by a sum of two exponentials with time constants equal to 126 and 880 fs. The molecular theory (developed earlier) predicts a time constant equal to 52 fs for the initial Gaussian decay and time constants equal to 134 and 886 fs for the two exponential components at the long time. This nearly perfect agreement is obtained by using the most detailed dynamical information available in the literature. The present study emphasizes the importance of the intermolecular vibrational band originating from the O...O stretching mode of the O�H...O units in the initial dynamics and raises several interesting questions regarding the nature of the decay of this mode. We have also studied the effects of isotope substitution on solvation dynamics. It is predicted that a significant isotope effect may be observed in the long time. The experimental results have also been compared with the prediction of the dynamic mean spherical approximation (DMSA); the agreement is not satisfactory at the long time. It is further found that the molecular theory and the DMSA lead to virtually identical results if the translational modes of the solvent molecules are neglected in the former. DMSA has also been used to investigate the dynamics of solvation of a dipolar solute in water. It is found that the dynamics of dipolar solvation exhibit features rather different from those of ion solvation. © 1995 American Institute of Physics.
Resumo:
Consider a single-server multiclass queueing system with K classes where the individual queues are fed by K-correlated interrupted Poisson streams generated in the states of a K-state stationary modulating Markov chain. The service times for all the classes are drawn independently from the same distribution. There is a setup time (and/or a setup cost) incurred whenever the server switches from one queue to another. It is required to minimize the sum of discounted inventory and setup costs over an infinite horizon. We provide sufficient conditions under which exhaustive service policies are optimal. We then present some simulation results for a two-class queueing system to show that exhaustive, threshold policies outperform non-exhaustive policies.
Resumo:
In this paper, the role of melt convection on the performance of heat sinks with phase change material (PCM) is investigated numerically. The heat sink consists of aluminum plate fins embedded in PCM, and is subjected to heat flux supplied from the bottom. A single-domain enthalpy-based CFD model is developed, which is capable of simulating the phase change process and the associated melt convection. The CFD model is coupled with a genetic algorithm for carrying out the optimization. Two cases are considered, namely, one without melt convection (i.e., conduction heat transfer analysis), and the other with convection. It is found that the geometrical optimizations of heat sinks are different for the two cases, indicating the importance of melt convection in the design of heat sinks with PCMs. In the case of conduction analysis, the optimum width of half fin (i.e., sum of half pitch and half fin thickness) is a constant, which is in good agreement with results reported in the literature. On the other hand, if melt convection is considered, the optimum half fin width depends on the effective thermal diffusivity due to conduction and convection. With melt convection, the optimized design results in a significant improvement of operational time.
Resumo:
2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9-hexadecafluorodecyl 1,10-ditosylate and its precursors were synthesized and characterized by H-1- and F-19-NMR spectroscopic methods and X-ray crystallography. These compounds are building blocks for the syntheses of the surfactants containing polyperfluoromethylene spacer. The molecule has extended all-trans conformation with molecular symmetry (1) over bar (C-i). There is a reasonably strong C-H ... O interaction in the crystal and there are two F ... F intermolecular contact distances less than the sum of van der Waals radii. (C) 1999 Elsevier Science B.V. All rights reserved.
Resumo:
We consider Gaussian multiple-input multiple-output (MIMO) channels with discrete input alphabets. We propose a non-diagonal precoder based on X-Codes in to increase the mutual information. The MIMO channel is transformed into a set of parallel subchannels using Singular Value Decomposition (SVD) and X-codes are then used to pair the subchannels. X-Codes are fully characterized by the pairings and the 2 × 2 real rotation matrices for each pair (parameterized with a single angle). This precoding structure enables to express the total mutual information as a sum of the mutual information of all the pairs. The problem of finding the optimal precoder with the above structure, which maximizes the total mutual information, is equivalent to i) optimizing the rotation angle and the power allocation within each pair and ii) finding the optimal pairing and power allocation among the pairs. It is shown that the mutual information achieved with the proposed pairing scheme is very close to that achieved with the optimal precoder by Cruz et al., and significantly better than mercury/waterfilling strategy by Lozano et al.. Our approach greatly simplifies both the precoder optimization and the detection complexity, making it suitable for practical applications.
Resumo:
We consider Gaussian multiple-input multiple-output (MIMO) channels with discrete input alphabets. We propose a non-diagonal precoder based on the X-Codes in 1] to increase the mutual information. The MIMO channel is transformed into a set of parallel subchannels using singular value decomposition (SVD) and X-Codes are then used to pair the subchannels. X-Codes are fully characterized by the pairings and a 2 x 2 real rotation matrix for each pair (parameterized with a single angle). This precoding structure enables us to express the total mutual information as a sum of the mutual information of all the pairs. The problem of finding the optimal precoder with the above structure, which maximizes the total mutual information, is solved by: i) optimizing the rotation angle and the power allocation within each pair and ii) finding the optimal pairing and power allocation among the pairs. It is shown that the mutual information achieved with the proposed pairing scheme is very close to that achieved with the optimal precoder by Cruz et al., and is significantly better than Mercury/waterfilling strategy by Lozano et al. Our approach greatly simplifies both the precoder optimization and the detection complexity, making it suitable for practical applications.
Resumo:
The structure of a type I langbeinite, Rb2Cd2(SO4)(3), displays three different phases, cubic with a = 10.378(5) Angstrom (space group P2(1)3) at room temperature, monoclinic at 120 K with a = 10.328(3), b = 10.322(3), c = 10.325(3) Angstrom, beta = 89.975(1)degrees (space group P2(1)), and orthorhombic at 85 K with a = 10.319(2), b = 10.321(2), c = 10.320(2) Angstrom (space group P2(1)2(1)2(1)), respectively. Precise single-crystal analyses of these phases indicate that Rb2Cd2(SO4)(3) distorts initially from cubic to monoclinic upon cooling followed by a significant reorientation of the SO4 tetrahedra, resulting in an orthorhombic symmetry upon further cooling. The three structures have been established unequivocally using the same crystal. There is no indication of the formation of an intermediate triclinic phase or any lattice disorder as conjectured in several earlier reports on compounds belonging to the type I langbeinite. The bond valence sum analyses of the coordination around the Rb sites indicate asymmetry in the bond strengths which could be the driving force of the ferroelectric behavior in these materials.
Resumo:
The variation of resistivity of the lithium fast-ion conductor Li3+y Ge1−yO4 (y = 0.25, 0.6, 0.72) has been studied with hydrostatic pressure up to 70 kbar and compared with that of Li16−2x Znx (GeO4)4(x = 1, 2). Both types showed pronounced resistivity maxima between 20–30 kbar and marked decrease thereafter. Measurements as a function of temperature between 120–300 K permitted the determination of activation energies and prefactors that also showed corresponding maxima. The activation volumes (ΔV) of the first type of compound varied between 4.34 to −4.90 cm3/mol at 300 K and decreased monotonically with increasing temperature. For the second type ΔV was much smaller, varied with pressure between 0.58 and −0.24 cm3/mol, and went through a maximum with increasing temperature. High-pressure studies were also conducted on aged samples, and the results are discussed in conjunction with results of impedance measurements and nuclear magnetic resonance (NMR) studies. The principal effect of pressure appears to be variations of the sum of interatomic potentials and hence barrier height, which also causes significant changes in entropy.
Resumo:
We study odd-membered chains of spin-1/2 impurities, with each end connected to its own metallic lead. For antiferromagnetic exchange coupling, universal two-channel Kondo (2CK) physics is shown to arise at low energies. Two overscreening mechanisms are found to occur depending on coupling strength, with distinct signatures in physical properties. For strong interimpurity coupling, a residual chain spin-1/2 moment experiences a renormalized effective coupling to the leads, while in the weak-coupling regime, Kondo coupling is mediated via incipient single-channel Kondo singlet formation. We also investigate models in which the leads are tunnel-coupled to the impurity chain, permitting variable dot filling under applied gate voltages. Effective low-energy models for each regime of filling are derived, and for even fillings where the chain ground state is a spin singlet, an orbital 2CK effect is found to be operative. Provided mirror symmetry is preserved, 2CK physics is shown to be wholly robust to variable dot filling; in particular, the single-particle spectrum at the Fermi level, and hence the low-temperature zero-bias conductance, is always pinned to half-unitarity. We derive a Friedel-Luttinger sum rule and from it show that, in contrast to a Fermi liquid, the Luttinger integral is nonzero and determined solely by the ``excess'' dot charge as controlled by gate voltage. The relevance of the work to real quantum dot devices, where interlead charge-transfer processes fatal to 2CK physics are present, is also discussed. Physical arguments and numerical renormalization-group techniques are used to obtain a detailed understanding of these problems.
Resumo:
In a recent paper, we combined the technique of bosonization with the concept of a Rayleigh dissipation function to develop a model for resistances in one-dimensional systems of interacting spinless electrons Europhys. Lett. 93, 57007 (2011)]. We also studied the conductance of a system of three wires by using a current splitting matrix M at the junction. In this paper, we extend our earlier work in several ways. The power dissipated in a three-wire system is calculated as a function of M and the voltages applied in the leads. By combining two junctions of three wires, we examine a system consisting of two parallel resistances. We study the conductance of this system as a function of the M matrices and the two resistances; we find that the total resistance is generally quite different from what one expects for a classical system of parallel resistances. We do a sum over paths to compute the conductance of this system when one of the two resistances is taken to be infinitely large. We study the conductance of a three-wire system of interacting spin-1/2 electrons, and show that the charge and spin conductances can generally be different from each other. Finally, we consider a system of two wires that are coupled by a dissipation function, and we show that this leads to a current in one wire when a voltage bias is applied across the other wire.
Resumo:
In pay-per click sponsored search auctions which are currently extensively used by search engines, the auction for a keyword involves a certain number of advertisers (say k) competing for available slots (say m) to display their ads. This auction is typically conducted for a number of rounds (say T). There are click probabilities mu_ij associated with agent-slot pairs. The search engine's goal is to maximize social welfare, for example, the sum of values of the advertisers. The search engine does not know the true value of an advertiser for a click to her ad and also does not know the click probabilities mu_ij s. A key problem for the search engine therefore is to learn these during the T rounds of the auction and also to ensure that the auction mechanism is truthful. Mechanisms for addressing such learning and incentives issues have recently been introduced and would be referred to as multi-armed-bandit (MAB) mechanisms. When m = 1,characterizations for truthful MAB mechanisms are available in the literature and it has been shown that the regret for such mechanisms will be O(T^{2/3}). In this paper, we seek to derive a characterization in the realistic but nontrivial general case when m > 1 and obtain several interesting results.
Resumo:
[1] D. Tse and P. Viswanath, Fundamentals of Wireless Communication.Cambridge University Press, 2006. [2] H. Bolcskei, D. Gesbert, C. B. Papadias, and A.-J. van der Veen, Spacetime Wireless Systems: From Array Processing to MIMO Communications.Cambridge University Press, 2006. [3] Q. H. Spencer, C. B. Peel, A. L. Swindlehurst, and M. Haardt, “An introduction to the multiuser MIMO downlink,” IEEE Commun. Mag.,vol. 42, pp. 60–67, Oct. 2004. [4] K. Kusume, M. Joham,W. Utschick, and G. Bauch, “Efficient tomlinsonharashima precoding for spatial multiplexing on flat MIMO channel,”in Proc. IEEE ICC’2005, May 2005, pp. 2021–2025. [5] R. Fischer, C. Windpassinger, A. Lampe, and J. Huber, “MIMO precoding for decentralized receivers,” in Proc. IEEE ISIT’2002, 2002, p.496. [6] M. Schubert and H. Boche, “Iterative multiuser uplink and downlink beamforming under SINR constraints,” IEEE Trans. Signal Process.,vol. 53, pp. 2324–2334, Jul. 2005. [7] ——, “Solution of multiuser downlink beamforming problem with individual SINR constraints,” IEEE Trans. Veh. Technol., vol. 53, pp.18–28, Jan. 2004. [8] A. Wiesel, Y. C. Eldar, and Shamai, “Linear precoder via conic optimization for fixed MIMO receivers,” IEEE Trans. Signal Process., vol. 52,pp. 161–176, Jan. 2006. [9] N. Jindal, “MIMO broadcast channels with finite rate feed-back,” in Proc. IEEE GLOBECOM’2005, Nov. 2005. [10] R. Hunger, F. Dietrich, M. Joham, and W. Utschick, “Robust transmit zero-forcing filters,” in Proc. ITG Workshop on Smart Antennas, Munich,Mar. 2004, pp. 130–137. [11] M. B. Shenouda and T. N. Davidson, “Linear matrix inequality formulations of robust QoS precoding for broadcast channels,” in Proc.CCECE’2007, Apr. 2007, pp. 324–328. [12] M. Payaro, A. Pascual-Iserte, and M. A. Lagunas, “Robust power allocation designs for multiuser and multiantenna downlink communication systems through convex optimization,” IEEE J. Sel. Areas Commun.,vol. 25, pp. 1392–1401, Sep. 2007. [13] M. Biguesh, S. Shahbazpanahi, and A. B. Gershman, “Robust downlink power control in wireless cellular systems,” EURASIP Jl. Wireless Commun. Networking, vol. 2, pp. 261–272, 2004. [14] B. Bandemer, M. Haardt, and S. Visuri, “Liner MMSE multi-user MIMO downlink precoding for users with multple antennas,” in Proc.PIMRC’06, Sep. 2006, pp. 1–5. [15] J. Zhang, Y. Wu, S. Zhou, and J. Wang, “Joint linear transmitter and receiver design for the downlink of multiuser MIMO systems,” IEEE Commun. Lett., vol. 9, pp. 991–993, Nov. 2005. [16] S. Shi, M. Schubert, and H. Boche, “Downlink MMSE transceiver optimization for multiuser MIMO systems: Duality and sum-mse minimization,”IEEE Trans. Signal Process., vol. 55, pp. 5436–5446, Nov.2007. [17] A. Mezghani, M. Joham, R. Hunger, and W. Utschick, “Transceiver design for multi-user MIMO systems,” in Proc. WSA 2006, Mar. 2006. [18] R. Doostnejad, T. J. Lim, and E. Sousa, “Joint precoding and beamforming design for the downlink in a multiuser MIMO system,” in Proc.WiMob’2005, Aug. 2005, pp. 153–159. [19] N. Vucic, H. Boche, and S. Shi, “Robust transceiver optimization in downlink multiuser MIMO systems with channel uncertainty,” in Proc.IEEE ICC’2008, Beijing, China, May 2008. [20] A. Ben-Tal and A. Nemirovsky, “Selected topics in robust optimization,”Math. Program., vol. 112, pp. 125–158, Feb. 2007. [21] D. Bertsimas and M. Sim, “Tractable approximations to robust conic optimization problems,” Math. Program., vol. 107, pp. 5–36, Jun. 2006. [22] P. Ubaidulla and A. Chockalingam, “Robust Transceiver Design for Multiuser MIMO Downlink,” in Proc. IEEE Globecom’2008, New Orleans, USA, Dec. 2008, to appear. [23] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2004. [24] G. H. Golub and C. F. V. Loan, Matrix Computations. The John Hopkins University Press, 1996.
Resumo:
We consider a setting in which several operators offer downlink wireless data access services in a certain geographical region. Each operator deploys several base stations or access points, and registers some subscribers. In such a situation, if operators pool their infrastructure, and permit the possibility of subscribers being served by any of the cooperating operators, then there can be overall better user satisfaction, and increased operator revenue. We use coalitional game theory to investigate such resource pooling and cooperation between operators.We use utility functions to model user satisfaction, and show that the resulting coalitional game has the property that if all operators cooperate (i.e., form a grand coalition) then there is an operating point that maximizes the sum utility over the operators while providing the operators revenues such that no subset of operators has an incentive to break away from the coalition. We investigate whether such operating points can result in utility unfairness between users of the various operators. We also study other revenue sharing concepts, namely, the nucleolus and the Shapely value. Such investigations throw light on criteria for operators to accept or reject subscribers, based on the service level agreements proposed by them. We also investigate the situation in which only certain subsets of operators may be willing to cooperate.