Les patients atteints de cancer traversent des conditions d’existence extrêmes demandant un cadre spécifique de prise en charge psychothérapique. Le cancer et les soins anticancéreux indispensables, forment pourtant la situation cancéreuse envahie par les logiques processuelles du cancer, violentes. Cette situation peut être un raz de marrée dans la vie d’un sujet, emportant les convictions les plus établies et les bases narcissiques-identitaires et du caractère les plus ancrées. Le sujet présente un risque majeur d’effondrement. De plus, la puissance du traumatisme actuel puise ses racines dans la reviviscence de traumatismes primaires restés jusque là éteints. Leur retour a lieu sous la forme de sensations hallucinatoires induisant des états de corps et des états de perception du monde extérieur psychiquement irreprésentables. Le sujet se vit et s’éprouve alors passivement, sans pouvoir s’affecter véritablement. Mortifères, la pesanteur, l’inertie et la douleur dominent ou au contraire, le sujet se sent à vif, hypersensible, envahi, persécuté, au risque de l’éclatement. Le monde s’articule alors essentiellement sur cette bipolarité que vient recouvrir la défense opératoire radicale de la blancheur. Elle jette son dévolu sur le monde, les relations, les objets, les affects, le corps du sujet. Parfois, rien ne touche ce dernier dont la psyché s’est resserrée autour de son noyau archaïque aux limites psyché-soma. Le cancer éradique la subjectivité, subtilisant le principe actif des logiques de l’originaire. Cet état de mélancolie blanche parfois durable, n’est que l’une des phases d’une processualité mélancolique polymorphe. Cette dynamique domine la vie du sujet selon deux tendances à la proto-mélancolie et à la proto-manie, qui remplacent le monde affectif par une propension à l’inertie ou à la psychomotricité. Le travail de mélancolie vise la relance des capacités d’identification en impasse. Nous allons étudier les modalités spécifiques du transfert et en particulier la mobilisation essentielle d’un transfert formel de base. Il fonctionne à partir de l’activation originaire en double de signifiants formels alors partagés par le thérapeute et son patient. Des mouvements de léthargie et d’excitations psychocorporelles peuvent gagner le clinicien et plonger la relation thérapeutique dans des états crépusculaires, relatifs au cancer et au retour des traumatiques primaires. Nous verrons comment le but premier de la psychothérapie vise l’utilisation psychique – et non l’éradication – de l’objet-cancer, comme moyen de forger les conditions de viabilité du cadre : permettre la mise en représentation des états de corps, rétablir la symbolisation, l’imagination et le recours aux fantasmes inconscients. Ce sont là les bases indispensables d’une psychothérapie auprès des patients atteints de cancer. / Cancer patients experience extreme conditions of existence requiring a specific form of psychotherapy. The cancer and essential anticancer treatments together form the cancerous situation, invaded by the cancer’s violent, processual logic. This situation can constitute a sea change in the subject’s life, sweeping away their most firmly held convictions and the most deeply rooted foundations of their narcissistic identity and character. The subject is at major risk of suffering a breakdown. In addition, the ‘actual’ trauma draws strength from the revival of primary traumas up until now extinguished. Their return takes the form of hallucinatory sensations producing states of body and perception of the external world psychologically unrepresentable. The subject sees and experiences themself passively, without really being capable of feeling affected. Deadly dullness, inertia and pain dominate or, on the contrary, the subject feels vividly alive, hypersensitive, invaded and persecuted, at the risk of bursting. The world essentially revolves around this bipolarity, which the radical operational defence system covers in whiteness. It throws its mantle over the world, relationships, objects, affects and the subject’s body. Sometimes nothing can touch the subject at all, and their psyche is reduced to its archaic core, at the edge of psyche-soma. The cancer eradicates subjectivity, steeling away the active principle of primal logic. This sometimes lasting state of white melancholy is but one phase in a polymorphic melancholic processuality. This force dominates the subject’s life, with a tendency either to proto-melancholy or proto-mania, which replace the affective world by a propensity to inertia or psychomotricity. The aim of melancholy work is to revive the deadlocked capacity for identification. We will examine the specific use of transference and, in particular, the key implementation of a basic formal transference. This works based on the dual primal activation of formal signifiers shared by the therapist and their patient. The therapist may be subject to motions of lethargy and psychocorporal excitations, plunging the therapeutic relationship into crepuscular states, relative to the cancer and to the return of primary traumas. We will look at how the principle aim of psychotherapy is the psychological use, and not eradication, of the cancer object, as a means of forging the conditions rendering the therapeutic context feasible: allow the representation of states of body, restore symbolisation, imagination and recourse to unconscious fantasy. Together, these form the essential basis of psychotherapy for cancer patients.

Using a poststructural and reader-response theoretical framework, the author explores competing ideas of interpretation, epistemology, and the problematic nature of truth and meaning in Henry James’s novel, The Golden Bowl. The author analyzes the ways in which emergent nineteenth century communication technologies, specifically how telegraphy both mediates and facilitates intimacy in a modern landscape. James anticipates modern forms of social media by exploring the nuances and the potential erotic nature of mediated communication and knowledge.

Orientador: Antonio Roberto Balbo / Banca: Márcia Marcondes Altimari Samed / Banca: Edmea Cassia Baptista / Resumo: Este trabalho visa a investigação e implementação de métodos Primal - Dual Previsor-Corretor de Pontos Interiores com a estratégia de busca unidimensional, e a aplicação destes em problemas de Despacho Econômico e Ambiental. Objetiva-se utilizar estes métodos para determinar soluções aproximadas e consistentes dos problemas causados citados, que forneçam a solução de minimização dos custos dos combustíveis empregados na geração termoelétrica de energia, otimizando um processo de alocação da demanda de energia elétrica entre as unidades geradoras disponíveis, de tal forma que as restrições operacionais sejam atendidas e que o custo de geração é minimizado. Pretende-se também, analisar o problema de Despacho Ambiental com um objetivo único quando se acopla a este o Problema de Despacho Econômico e busca-se, simultaneamente, a minimização dos custos de geração e a redução da emissão de poluentes na natureza. Os métodos foram implementados, testados em Problemas de Despacho Econômico e Ambiental, e o seu desempenho foi comparado com outros métodos já utilizados, cujos resultados são encontrados na literatura / Abstract: This work aims the investigation and implementation of Primal-Dual Predictor-Corrector interior points methods, with the strategy of one-dimensional search, and its application in Economic and Environmental Dispatch Problems. It pretends to use these methods to determine approximate and consistent solutions of the mentioned problems, that provide the solution to minimize the fuel costs used in thermoelectric power generation, optimizing an allocations process of eletric power demand among available generation units, such that the operational constraints are attended and that generation cost is minimized. It too pretends to analyze the Environmental Dispatch Problem with the one objective when it is joined with the Dispatch Problems and it searchs, simultaneously, the minimization of the generation costs and the reduction of emission of the polluants in the nature. The methods were implemented, tested on the Economic and Environemental Dispatch Problems and its performance was compared with others method currently used, whose results are found in the literature / Mestre

Loss is a fundamental part of the human experience, from the loss of security and innocence that comes with the necessary separation of child from parent to the ultimate loss of life. Along the way, there are the losses of jobs, of incomes, of homes; the losses of friendships, of family members, of lovers; the losses of direction, of control, of hope. As cognitive and caring beings, humans struggle to cope with these losses, to greater and lesser degrees of success. This is the theme at the heart of this thesis. Fire Ants is composed of ten short stories, fictive works, which differ in specific subject matter, yet deal unilaterally with issues of loss. Like the venomous creatures that threaten to eat B. D. Packard alive in the title story, life eats away at a number of characters in the collection who are deficient. The narrators in "Aftermath" and "Hues," for example, suffer psychological -- if not physical -- deaths. But not all of the characters lack coping mechanisms, unhealthy as they may sometimes be. As the stories unfold, some characters begin to gain small degrees of perspective and understanding, to learn that while life is full of loss, it is not always entirely bleak. As demonstrated in "Cross Creek," good exists, though it is not always where one might expect it. And life can be full despite loss, as depicted in "Stitches."

Après une description de la méthode de Karmarkar, il est montré que la valeur du pas de déplacement peut être largement améliorée. Les principales difficultés pratiques de la méthode sont discutées. Plus particulièrement, l'hypothèse de connaitre, au départ, la valeur optimale de l'objectif. Diverses extensions et variantes sont étudiées dans le but de relaxer l'hypothèse ci-dessus

The Steiner Tree problem has appeared in the Karp's list of the first 21 NP-hard problems and is well known as one of the most fundamental problems in Network Design area. We study the Node-Weighted version of the Prize Collecting Steiner Tree problem. In this problem, we are given a simple graph with a cost and penalty value associated with each node. Our goal is to find a subtree T of the graph minimizing the cost of the nodes in T plus penalty of the nodes not in T. By a reduction from set cover problem it can be easily shown that the problem cannot be approximated in polynomial time within factor of (1-o(1))ln n unless NP has quasi-polynomial time algorithms, where n is the number of vertices of the graph. Moss and Rabani claimed an O(log n)-approximation algorithm for the problem using a Primal-Dual approach in their STOC'01 paper \cite{moss2001}. We show that their algorithm is incorrect by providing a counter example in which there is an O(n) gap between the dual solution constructed by their algorithm and the optimal solution. Further, evidence is given that their algorithm probably does not have a simple fix. We propose a new algorithm which is more involved and introduces novel ideas in primal dual approach for network design problems. Also, our algorithm is a Lagrangian Multiplier Preserving algorithm and we show how this property can be utilized to design an O(log n)-approximation algorithm for the Node-Weighted Quota Steiner Tree problem using the Lagrangian Relaxation method. We also show an application of the Node Weighted Quota Steiner Tree problem in designing algorithm with better approximation factor for Technology Diffusion problem, a problem proposed by Goldberg and Liu in \cite{goldberg2012} (SODA 2013). In Technology Diffusion, we are given a graph G and a threshold θ(v) associated with each vertex v and we are seeking a set of initial nodes called the seed set. Technology Diffusion is a dynamic process defined over time in which each vertex is either active or inactive. The vertices in the seed set are initially activated and each other vertex v gets activated whenever there are at least θ(v) active nodes connected to v through other active nodes. The Technology Diffusion problem asks to find the minimum seed set activating all nodes. Goldberg and Liu gave an O(rllog n)-approximation algorithm for the problem where r and l are the diameter of G and the number of distinct threshold values, respectively. We improve the approximation factor to O(min{r,l}log n) by establishing a close connection between the problem and the Node Weighted Quota Steiner Tree problem.

We present an axiomatization of relational varieties, i.e., classes of relational structures closed under formation of products and retracts, by a certain class of first-order sentences. We apply this result to categorically equivalent algebras and primal algebras. We consider the relational varieties generated by structures with minimal clone, rigid structures and two-element structures.

The Steiner Tree problem has appeared in the Karp's list of the first 21 NP-hard problems and is well known as one of the most fundamental problems in Network Design area. We study the Node-Weighted version of the Prize Collecting Steiner Tree problem. In this problem, we are given a simple graph with a cost and penalty value associated with each node. Our goal is to find a subtree T of the graph minimizing the cost of the nodes in T plus penalty of the nodes not in T. By a reduction from set cover problem it can be easily shown that the problem cannot be approximated in polynomial time within factor of (1-o(1))ln n unless NP has quasi-polynomial time algorithms, where n is the number of vertices of the graph. Moss and Rabani claimed an O(log n)-approximation algorithm for the problem using a Primal-Dual approach in their STOC'01 paper \cite{moss2001}. We show that their algorithm is incorrect by providing a counter example in which there is an O(n) gap between the dual solution constructed by their algorithm and the optimal solution. Further, evidence is given that their algorithm probably does not have a simple fix. We propose a new algorithm which is more involved and introduces novel ideas in primal dual approach for network design problems. Also, our algorithm is a Lagrangian Multiplier Preserving algorithm and we show how this property can be utilized to design an O(log n)-approximation algorithm for the Node-Weighted Quota Steiner Tree problem using the Lagrangian Relaxation method. We also show an application of the Node Weighted Quota Steiner Tree problem in designing algorithm with better approximation factor for Technology Diffusion problem, a problem proposed by Goldberg and Liu in \cite{goldberg2012} (SODA 2013). In Technology Diffusion, we are given a graph G and a threshold θ(v) associated with each vertex v and we are seeking a set of initial nodes called the seed set. Technology Diffusion is a dynamic process defined over time in which each vertex is either active or inactive. The vertices in the seed set are initially activated and each other vertex v gets activated whenever there are at least θ(v) active nodes connected to v through other active nodes. The Technology Diffusion problem asks to find the minimum seed set activating all nodes. Goldberg and Liu gave an O(rllog n)-approximation algorithm for the problem where r and l are the diameter of G and the number of distinct threshold values, respectively. We improve the approximation factor to O(min{r,l}log n) by establishing a close connection between the problem and the Node Weighted Quota Steiner Tree problem.

This diploma thesis deals mainly with iconography of miraculous events at selected places of pilgrimage on the background of their factual history and the overall tradition of certain Marian cults. The first part of the thesis is devoted to the analysis of deliberately chosen pilgrimage sites in all cases, with an emphasis on their initial and other specific miraculous events of non-biblical nature concerning primarily the lives of ordinary people. These analyzes provide a basic insight into the general-factographic history of the relevant sites, which is necessary for the detailed examination of the relevant miraculous events. Primary attention is devoted to the analysis of the original miracles of the pilgrimage sites, especially by their depictions. Within the scope of individual pilgrimage sites, this thesis also seeks to analyze all other pictures of the mercy of the Marian. Great emphasis is also placed on written entries of the mentioned miraculous events, which in most cases very probably preceded their picture delineation. The second part of the thesis tries to systemate the results of the researches and compare them with one another. It is a comparison of the miraculous images that are being discussed, which are done mainly in terms of content and in terms of their writing. It is a...

Cette thèse s’inscrit dans le cadre de la conception, l’analyse et la mise en œuvre d’algorithmes efficaces et fiables pour la résolution de problèmes d’optimisation non linéaire avec contraintes. Nous présentons trois nouveaux algorithmes fortement primaux-duaux pour résoudre ces problèmes. La première caractéristique de ces algorithmes est que le contrôle des itérés s’effectue dans l’espace primal-dual tout au long du processus de la minimisation, d’où l’appellation “fortement primaux-duaux”. En particulier, la globalisation est effectuée par une méthode de recherche linéaire qui utilise une fonction de mérite primale-duale. La deuxième caractéristique est l’introduction d’une régularisation naturelle du système linéaire qui est résolu à chaque itération pour calculer une direction de descente. Ceci permet à nos algorithmes de bien se comporter pour résoudre les problèmes dégénérés pour lesquels la jacobienne des contraintes n’est pas de plein rang. La troisième caractéristique est que le paramètre de pénalisation est autorisé à augmenter au cours des itérations internes, alors qu’il est généralement maintenu constant. Cela permet de réduire le nombre d’itérations internes. Une étude théorique détaillée incluant l’analyse de convergence globale des itérations internes et externes, ainsi qu’une analyse asymptotique a été présentée pour chaque algorithme. En particulier, nous montrons qu’ils jouissent d’un taux de convergence rapide, superlinéaire ou quadratique. Ces algorithmes sont implémentés dans un nouveau solveur d’optimisation non linéaire qui est appelé SPDOPT. Les bonnes performances de ce solveur ont été montrées en effectuant des comparaisons avec les codes de références IPOPT, ALGENCAN et LANCELOT sur une large collection de problèmes. / This thesis focuses on the design, analysis, and implementation of efficient and reliable algorithms for solving nonlinearly constrained optimization problems. We present three new strongly primal-dual algorithms to solve such problems. The first feature of these algorithms is that the control of the iterates is done in both primal and dual spaces during the whole minimization process, hence the name “strongly primal-dual”. In particular, the globalization is performed by applying a backtracking line search algorithm based on a primal-dual merit function. The second feature is the introduction of a natural regularization of the linear system solved at each iteration to compute a descent direction. This allows our algorithms to perform well when solving degenerate problems for which the Jacobian of constraints is rank deficient. The third feature is that the penalty parameter is allowed to increase along the inner iterations, while it is usually kept constant. This allows to reduce the number of inner iterations. A detailed theoretical study including the global convergence analysis of both inner and outer iterations, as well as an asymptotic convergence analysis is presented for each algorithm. In particular, we prove that these methods have a high rate of convergence : superlinear or quadratic. These algorithms have been implemented in a new solver for nonlinear optimization which is called SPDOPT. The good practical performances of this solver have been demonstrated by comparing it to the reference codes IPOPT, ALGENCAN and LANCELOT on a large collection of test problems.