Forever Young: Aging Control For Smartphones In Hybrid Networks

The demand for Internet services that require frequent updates through small messages, such as microblogging, has tremendously grown in the past few years. Although the use of such applications by domestic users is usually free, their access from mobile devices is subject to fees and consumes energy from limited batteries. If a user activates his mobile device and is in range of a service provider, a content update is received at the expense of monetary and energy costs. Thus, users face a tradeoff between such costs and their messages aging. The goal of this paper is to show how to cope with such a tradeoff, by devising \emph{aging control policies}. An aging control policy consists of deciding, based on the current utility of the last message received, whether to activate the mobile device, and if so, which technology to use (WiFi or 3G). We present a model that yields the optimal aging control policy. Our model is based on a Markov Decision Process in which states correspond to message ages. Using our model, we show the existence of an optimal strategy in the class of threshold strategies, wherein users activate their mobile devices if the age of their messages surpasses a given threshold and remain inactive otherwise. We then consider strategic content providers (publishers) that offer \emph{bonus packages} to users, so as to incent them to download updates of advertisement campaigns. We provide simple algorithms for publishers to determine optimal bonus levels, leveraging the fact that users adopt their optimal aging control strategies. The accuracy of our model is validated against traces from the UMass DieselNet bus network.Comment: See also http://www-net.cs.umass.edu/~sadoc/agecontrol

Constrained Cost-Coupled Stochastic Games with Independent State Processes

We consider a non-cooperative constrained stochastic games with N players with the following special structure. With each player there is an associated controlled Markov chain. The transition probabilities of the i-th Markov chain depend only on the state and actions of controller i. The information structure that we consider is such that each player knows the state of its own MDP and its own actions. It does not know the states of, and the actions taken by other players. Finally, each player wishes to minimize a time-average cost function, and has constraints over other time-avrage cost functions. Both the cost that is minimized as well as those defining the constraints depend on the state and actions of all players. We study in this paper the existence of a Nash equilirium. Examples in power control in wireless communications are given.Comment: 7 pages, submitted in september 2006 to Operations Research Letter

A covalently bound photoisomerizable agonist. Comparison with reversibly bound agonists at electrophorus electroplaques

After disulphide bonds are reduced with dithiothreitol, trans-3-(alpha-bromomethyl)-3’-[alpha-(trimethylammonium)methyl]azobenzene (trans-QBr) alkylates a sulfhydryl group on receptors. The membrane conductance induced by this “tethered agonist” shares many properties with that induced by reversible agonists. Equilibrium conductance increases as the membrane potential is made more negative; the voltage sensitivity resembles that seen with 50 [mu]M carbachol. Voltage- jump relaxations follow an exponential time-course; the rate constants are about twice as large as those seen with 50 mu M carbachol and have the same voltage and temperature sensitivity. With reversible agonists, the rate of channel opening increases with the frequency of agonist-receptor collisions: with tethered trans-Qbr, this rate depends only on intramolecular events. In comparison to the conductance induced by reversible agonists, the QBr-induced conductance is at least 10-fold less sensitive to competitive blockade by tubocurarine and roughly as sensitive to “open-channel blockade” bu QX-222. Light-flash experiments with tethered QBr resemble those with the reversible photoisomerizable agonist, 3,3’,bis-[alpha-(trimethylammonium)methyl]azobenzene (Bis-Q): the conductance is increased by cis {arrow} trans photoisomerizations and decreased by trans {arrow} cis photoisomerizations. As with Bis-Q, ligh-flash relaxations have the same rate constant as voltage-jump relaxations. Receptors with tethered trans isomer. By comparing the agonist-induced conductance with the cis/tans ratio, we conclude that each channel’s activation is determined by the configuration of a single tethered QBr molecule. The QBr-induced conductance shows slow decreases (time constant, several hundred milliseconds), which can be partially reversed by flashes. The similarities suggest that the same rate-limiting step governs the opening and closing of channels for both reversible and tethered agonists. Therefore, this step is probably not the initial encounter between agonist and receptor molecules

Três sonetos de pó e água

Três sonetos de inspiração nos moldes de Petrarca, em variações livres, abordando temáticas relativas a plantio, ciclo da vida, criação, construção

Tendências da alimentação contemporânea: percurso e elementos para uma agenda de pesquisa

Em um quadro em que o tema alimentação vem tendo sua presença amplificada em diferentes espaços sociais – também na academia, com a consolidação dos Food Studies – e no processo de formulação de uma agenda de pesquisa voltada à reflexão sobre as tendências da alimentação contemporânea, particularmente no que se refere ao lugar dos alimentos locais, artesanais, tradicionais e aos apelos de ruralidade, naturalidade e saudabilidade, este texto se propõe a revisitar algumas das pesquisas conduzidas, ao longo da última década, no âmbito do Grupo de Estudos e Pesquisas em Alimentação, Consumo e Cultura (GEPAC)

Computing the Hit Rate of Similarity Caching

Similarity caching allows requests for an item $i$ to be served by a similar item $i'$. Applications include recommendation systems, multimedia retrieval, and machine learning. Recently, many similarity caching policies have been proposed, but still we do not know how to compute the hit rate even for the simplest policies, like SIM-LRU and RND-LRU that are straightforward modifications of classical caching algorithms. This paper proposes the first algorithm to compute the hit rate of similarity caching policies under the independent reference model for the request process. In particular, our work shows how to extend the popular TTL approximation from classic caching to similarity caching. The algorithm is evaluated on both synthetic and real world traces