973 resultados para self-adaptive
Resumo:
Promotional article recognizing a CASE (Career And Self Awareness) conference presentation.
Resumo:
Promotional article recognizing an award presented to the CASE (Career And Self Awareness) team.
Resumo:
Success Stories from the CASE (Career And Self Awareness) prototype.
Resumo:
General information on the CASE (Career And Self Awareness) prototype.
Resumo:
Contact information for the CASE (Career And Self Awareness) prototype.
Resumo:
Basic Points about the CASE (Career And Self Awareness) prototype.
Resumo:
Promotional article recognizing a CASE (Career And Self Awareness) conference demonstration.
Resumo:
In this work I study the stability of the dynamics generated by adaptivelearning processes in intertemporal economies with lagged variables. Iprove that determinacy of the steady state is a necessary condition for the convergence of the learning dynamics and I show that the reciprocal is not true characterizing the economies where convergence holds. In the case of existence of cycles I show that there is not, in general, a relationship between determinacy and convergence of the learning process to the cycle. I also analyze the expectational stability of these equilibria.
Resumo:
We consider an oligopolistic market game, in which the players are competing firm in the same market of a homogeneous consumption good. The consumer side is represented by a fixed demand function. The firms decide how much to produce of a perishable consumption good, and they decide upon a number of information signals to be sent into the population in order to attract customers. Due to the minimal information provided, the players do not have a well--specified model of their environment. Our main objective is to characterize the adaptive behavior of the players in such a situation.
Resumo:
We propose a simple adaptive procedure for playing a game. In thisprocedure, players depart from their current play with probabilities thatare proportional to measures of regret for not having used other strategies(these measures are updated every period). It is shown that our adaptiveprocedure guaranties that with probability one, the sample distributionsof play converge to the set of correlated equilibria of the game. Tocompute these regret measures, a player needs to know his payoff functionand the history of play. We also offer a variation where every playerknows only his own realized payoff history (but not his payoff function).
Resumo:
L'individu confronté au diagnostic de cancer subit un bouleversement brutal de ses repères et de ses habitudes. La maladie représente une menace pour son équilibre de vie et sa stabilité sociale. Sa capacité à faire face et à opérer différents remaniements dans sa façon d'être au monde et d'envisager l'avenir est en partie déterminée par ses ressources personnelles. Toutefois, le soutien émotionnel peut également représenter un moyen privilégié de donner du sens à cette expérience singulière qu'est la maladie. La reconstruction narrative dans un cadre soutenant, caractérisé par une écoute bienveillante, offre au patient la possibilité de reconnaître sa souffrance comme partie intégrante de lui-même. Un récit de vie qui intègre la maladie lui permet de se réapproprier son histoire. Cette démarche nécessite de la part du thérapeute une disponibilité psychique et temporelle et la capacité de soutenir le patient dans un processus de liaison à travers les différentes étapes de la maladie. The individual facing the diagnosis of cancer is subjected to abrupt changes with regard to his inner world, his life, habits and social relationships. The patient's capacity to cope, to integrate changes in the way of living and to face the future is determined by his personal resources. However, psychological support may also be an important mean to search for and find sense to the singular experience of the illness. The narrative reconstruction within a supportive setting provides the patient a possibility to recognise his sufferance as an integral part of himself. A life narrative, which integrates the illness, allows the patient to re-appropriate his history again. Such a therapeutic project necessitates from the therapist a psychological and temporal disponibility and a capacity to create links all along the different stages of the disease.
Resumo:
Prolonged deprivation of food induces dramatic changes in mammalian metabolism, including the release of large amounts of fatty acids from the adipose tissue, followed by their oxidation in the liver. The nuclear receptor known as peroxisome proliferator-activated receptor alpha (PPARalpha) was found to play a role in regulating mitochondrial and peroxisomal fatty acid oxidation, suggesting that PPARalpha may be involved in the transcriptional response to fasting. To investigate this possibility, PPARalpha-null mice were subjected to a high fat diet or to fasting, and their responses were compared with those of wild-type mice. PPARalpha-null mice chronically fed a high fat diet showed a massive accumulation of lipid in their livers. A similar phenotype was noted in PPARalpha-null mice fasted for 24 hours, who also displayed severe hypoglycemia, hypoketonemia, hypothermia, and elevated plasma free fatty acid levels, indicating a dramatic inhibition of fatty acid uptake and oxidation. It is shown that to accommodate the increased requirement for hepatic fatty acid oxidation, PPARalpha mRNA is induced during fasting in wild-type mice. The data indicate that PPARalpha plays a pivotal role in the management of energy stores during fasting. By modulating gene expression, PPARalpha stimulates hepatic fatty acid oxidation to supply substrates that can be metabolized by other tissues.
Resumo:
The Generalized Assignment Problem consists in assigning a setof tasks to a set of agents with minimum cost. Each agent hasa limited amount of a single resource and each task must beassigned to one and only one agent, requiring a certain amountof the resource of the agent. We present new metaheuristics forthe generalized assignment problem based on hybrid approaches.One metaheuristic is a MAX-MIN Ant System (MMAS), an improvedversion of the Ant System, which was recently proposed byStutzle and Hoos to combinatorial optimization problems, and itcan be seen has an adaptive sampling algorithm that takes inconsideration the experience gathered in earlier iterations ofthe algorithm. Moreover, the latter heuristic is combined withlocal search and tabu search heuristics to improve the search.A greedy randomized adaptive search heuristic (GRASP) is alsoproposed. Several neighborhoods are studied, including one basedon ejection chains that produces good moves withoutincreasing the computational effort. We present computationalresults of the comparative performance, followed by concludingremarks and ideas on future research in generalized assignmentrelated problems.