No description available.

In reading The story of Edgar Sawtelle, this essay applies posthuman studies with animal studies and disability studies to analyse how the communication between species occur and how boundaries are expanded. Non-verbal language is closely examined and argued to be just as viable as verbal language in the making of relationships and subjects in literature. By applying posthumanism, biological research and a non-anthropocentric way of thinking one can evolve from the notion that humans are the only subjects which matter, something that has been verified because non-human animals never have been given a voice or an acknowledgment of a language. What happens in a novel when the main protagonist is lacking the ability to speak verbally, when verbal language is what has constructed human exceptionalism over all the other species? / Denna uppsats tillämpar posthumanistiska studier med djurstudier och funktionshinder-studier för att analysera hur kommunikationen mellan arter äger rum och expanderar gränser i David Wroblewskis roman The Story of Edgar Sawtelle. Icke-verbalt språk undersöks och argumenteras vara lika betydande som verbalt språk vid skapandet av relationer och subjekt i litteratur. Genom att applicera posthumanism, biologisk forskning och ett icke-antropocentriskt sätt att tänka kan man avveckla tanken om att människan är det enda subjekt som räknas, detta är något som enbart verifierats eftersom icke-mänskliga djur aldrig fått någon agens eller bekräftande att de har rätten till en röst. Vad händer i en roman när protagonisten saknar förmågan till verbalt språk, när det verbala språket är central som verkning i mänsklig exceptionalism?

Submitted by Aelson Maciera (aelsoncm@terra.com.br) on 2017-09-26T19:15:52Z No. of bitstreams: 1 DissCDAC.pdf: 10114021 bytes, checksum: b3e4f52846924539caadab8587fe2250 (MD5) / Approved for entry into archive by Ronildo Prado (bco.producao.intelectual@gmail.com) on 2018-01-26T18:36:20Z (GMT) No. of bitstreams: 1 DissCDAC.pdf: 10114021 bytes, checksum: b3e4f52846924539caadab8587fe2250 (MD5) / Approved for entry into archive by Ronildo Prado (bco.producao.intelectual@gmail.com) on 2018-01-26T18:36:39Z (GMT) No. of bitstreams: 1 DissCDAC.pdf: 10114021 bytes, checksum: b3e4f52846924539caadab8587fe2250 (MD5) / Made available in DSpace on 2018-01-26T18:42:45Z (GMT). No. of bitstreams: 1 DissCDAC.pdf: 10114021 bytes, checksum: b3e4f52846924539caadab8587fe2250 (MD5) Previous issue date: 2017-03-10 / Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) / This work aims at treating the Dynamic Vehicle Allocation Problem (DVAP) in the context of the Brazilian Freight Transportation system. The problem consists of allocating empty vehicles to different terminals so as to attend the demand of freight transport during a predetermined planning horizon while maximizing the profit from these services. These type of decisions arise in customized freight transport services and in between-terminals operations of consolidation freight services. Given the size of the resulting models of real life problems confronted by third party logistics operators are large for using exact solution methods, heuristic methods have been used for giving good quality solution at the expense of optimality guarantee. In this context, the objective of this work is to contribute with solution methods that provide optimality guarantee or quality solution certificates for treating large-scale problems in reasonable computational times. The methods utilized are lagrangean relaxation, using subgradient optimization, and DantzigWolfe decomposition together with a lagrangian heuristic and factibilization method, respectively. Computational experiments are presented and analyzed for randomly generated instances and real-world instances from a brasilian freight operator. The latter method shows great potential for treating large-scale problems. / Este trabalho aborda o problema de Alocação Dinâmica de Veículos (PADV) no contexto de Transporte Rodoviário de Carga. O problema envolve alocar veículos de carga para atender a demanda de transporte de carga prevista entre terminais durante um horizonte de tempo multiperíodos e finito. O objetivo e maximizar o lucro gerado pelos serviços completados. Este tipo de decisões surge nos serviços de transporte de carga de lotação e na parcela de transporte de transferência dos serviços de transporte de carga consolidada. Dado que o tamanho dos problemas que enfrentam as transportadoras logísticas sÃo consideravelmente grandes parase resolver com métodos exatos em tempos computacionais aceitáveis, tem-se utilizado métodos heurísticos para dar boas soluções sem garantia de otimalidade mas em tempos toleráveis a estes problemas. Neste contexto, pretende-se contribuir com métodos de solução que proporcionem garantia de otimalidade e/ou boas soluções aproximadas, acompanhadas de certificados de otimalidade ou de qualidade de solução, para tratar problemas de porte em tempos razoáveis. Os métodos propostos estao baseados em relaxação lagrangiana, utilizando o método de otimização do subgradiente, e na decomposto de Dantzig Wolfe, utilizando a técnica de geração de colunas, além de heurísticas lagrangianas e de factibilização acopladas nestes métodos. Experimentos computacionais usando instâncias geradas aleatoriamente e baseados em dados reais de transportadoras brasileiras sao apresentados e analisados, para as duas abordagens, mostrando seus potenciais de aplicação pratica, principalmente para problemas de grande porte.

Made available in DSpace on 2014-06-11T19:22:32Z (GMT). No. of bitstreams: 0 Previous issue date: 2011-02-25Bitstream added on 2014-06-13T18:49:30Z : No. of bitstreams: 1 lopezquizhpi_jc_me_ilha.pdf: 769238 bytes, checksum: 591b6116b31bf1d4b2d4b7817c38a698 (MD5) / Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) / Neste trabalho apresenta-se uma metodologia para resolver o problema de planejamento ótimo de reativos em sistemas de potência interconectados multi-áreas, utilizando a técnica de decomposição de Dantzig-Wolfe. O problema original multi-área é separado em subproblemas (um para cada área) e um problema mestre (coordenador). A solução do problema decomposto é baseada na aplicação de programação linear sucessiva para a resolução dos subproblemas de planejamento de reativos de cada área, e o esquema de coordenação é baseado nos custos marginais de potência reativa nas barras de fronteiras. Desta forma, o problema de planejamento do sistema é resolvido usando a estratégia descentralizada por regiões ou por áreas, onde os operadores dos sistemas podem planejar a opera- ção e a expansão de seus sistemas, independentemente das outras áreas, obtendo uma solução ótima coordenada, porém descentralizada de cada área. O objetivo do modelo é proporcionar mecanismos para realizar o planejamento preservando a autonomia e confidencialidade para cada área, garantindo a economia global do sistema multi-área completo. Utilizando-se o modelo matemático e a imple- mentação computacional da metodologia proposta, apresentam-se resultados, análises e discussões de testes efetuados em 3 sistemas de 3 áreas, onde cada uma das áreas é composta por 3 sistemas iguais formados pelos sistemas IEEE30, IEEE118 e IEEE300 / In this thesis presents a methodology for solving the optimal reactive power planning problem in inter- conected multi-area electric power systems, using the Dantzig-Wolfe technique. The original multi- area problem is separated into subproblems (one for each area) and a master problem (coordinator). The solution of the decomposed problem is based on the application of sucessive linear programming for solving the reactive planning subproblems in each area, and the coordination scheme is based on the reactive power marginal costs in the border bus. Thus the planning problem system is solved using a descentralized approach by regions or areas, where de transmission system operator in each area can planning the operation and expansion of its system regardless of the other areas, obtaining a optimal solution coordinated by descentralized in each area. The purpose of the mathematical model is to provide mechanism for develope the planning preserving the autonomy and confidentiality for each area, ensuring the economy of the overal multi-area full system. Using the mathematical model and computational implementation of the methodology proposed results are presented analisys and discussion of testes performed on three systems in three areas where each area is composed of three equal systems formed by IEEE30, IEEE118, and IEEE300 bus system

The aim in this thesis is to develop efficient enumeration algorithms to solve certain strongly NP-hard scheduling problems. These algorithms were developed using a combination of ideas from Integer Programming, Constraint Programming and Scheduling Theory. In order to combine different techniques in one algorithm, decomposition methods are applied. The main idea on which the first part of our results is based is to separate the optimality and feasibility components of the problem and let different methods tackle these components. Then IP is ``responsible' for optimization, whereas specific combinatorial algorithms tackle the feasibility aspect. Branch-and-cut and branch-and-price algorithms based on this idea are proposed to solve the single-machine and multi-machine variants of the scheduling problem to minimize the sum of the weights of late jobs. Experimental research shows that the algorithms proposed outperform other algorithms available in the literature. Also, it is shown that these algorithms can be used, after some modification, to solve the problem of minimizing the maximum tardiness on unrelated machines. The second part of the thesis deals with the one-machine scheduling problem to minimize the weighted total tardiness. To tackle this problem, the idea of a partition of the time horizon into intervals is used. A particularity of this approach is that we exploit the structure of the problem to partition the time horizon. This particularity allowed us to propose two new Mixed Integer Programming formulations for the problem. The first one is a compact formulation and can be used to solve the problem using a standard MIP solver. The second formulation can be used to derive lower bounds on the value of the optimal solution of the problem. These lower bounds are of a good quality, and they can be obtained relatively fast.

This thesis aims to study the theoretical complexity and empirical performance of decomposition algorithms. We focus on linear programs with a block-angular structure. Decomposition algorithms used to be the only way to solve large-scale special structured problems, in terms of memory limit and CPU time. However, with the advances in computer technology over the past few decades, many large-scale problems can now be solved simply by using some general purpose LP software, without exploiting the problems' inner structures. A question arises naturally, should we solve a structured problem with decomposition, or directly solve it as a whole? We try to understand how a problem's characteristics influence its computational performance, and compare the relative efficiency of algorithms with and without decomposition. Two comparisons are conducted in our research: first, the Dantzig-Wolfe decomposition method (DW) versus the simplex method (simplex); second, the analytic center cutting plane method (ACCPM) versus the interior point method (IPM). These comparisons fall into the two main solution approaches in linear programming: simplex-based algorithms and IPM-based algorithms. Motivated by our observations of ACCPM and DW decomposition, we devise a hybrid algorithm combining ACCPM and DW, which are the counterparts of IPM and simplex in the decomposition framework, to take the advantages of both: the quick convergence rate of IPM-based methods, as well as the accuracy of simplex-based algorithms. A large set of 316 instances is incorporated in our experiments, so that different dimensioned problems with primal or dual block-angular structures are covered to test our conclusions.

This thesis aims to study the theoretical complexity and empirical performance of decomposition algorithms. We focus on linear programs with a block-angular structure. Decomposition algorithms used to be the only way to solve large-scale special structured problems, in terms of memory limit and CPU time. However, with the advances in computer technology over the past few decades, many large-scale problems can now be solved simply by using some general purpose LP software, without exploiting the problems' inner structures. A question arises naturally, should we solve a structured problem with decomposition, or directly solve it as a whole? We try to understand how a problem's characteristics influence its computational performance, and compare the relative efficiency of algorithms with and without decomposition. Two comparisons are conducted in our research: first, the Dantzig-Wolfe decomposition method (DW) versus the simplex method (simplex); second, the analytic center cutting plane method (ACCPM) versus the interior point method (IPM). These comparisons fall into the two main solution approaches in linear programming: simplex-based algorithms and IPM-based algorithms. Motivated by our observations of ACCPM and DW decomposition, we devise a hybrid algorithm combining ACCPM and DW, which are the counterparts of IPM and simplex in the decomposition framework, to take the advantages of both: the quick convergence rate of IPM-based methods, as well as the accuracy of simplex-based algorithms. A large set of 316 instances is incorporated in our experiments, so that different dimensioned problems with primal or dual block-angular structures are covered to test our conclusions.

Orientador: Jose Roberto Sanches Mantovani / Banca: Rubén Augusto Romero Lázaro / Banca: João Bosco Augusto London Junior / Resumo: Neste trabalho apresenta-se uma metodologia para resolver o problema de planejamento ótimo de reativos em sistemas de potência interconectados multi-áreas, utilizando a técnica de decomposição de Dantzig-Wolfe. O problema original multi-área é separado em subproblemas (um para cada área) e um problema mestre (coordenador). A solução do problema decomposto é baseada na aplicação de programação linear sucessiva para a resolução dos subproblemas de planejamento de reativos de cada área, e o esquema de coordenação é baseado nos custos marginais de potência reativa nas barras de fronteiras. Desta forma, o problema de planejamento do sistema é resolvido usando a estratégia descentralizada por regiões ou por áreas, onde os operadores dos sistemas podem planejar a opera- ção e a expansão de seus sistemas, independentemente das outras áreas, obtendo uma solução ótima coordenada, porém descentralizada de cada área. O objetivo do modelo é proporcionar mecanismos para realizar o planejamento preservando a autonomia e confidencialidade para cada área, garantindo a economia global do sistema multi-área completo. Utilizando-se o modelo matemático e a imple- mentação computacional da metodologia proposta, apresentam-se resultados, análises e discussões de testes efetuados em 3 sistemas de 3 áreas, onde cada uma das áreas é composta por 3 sistemas iguais formados pelos sistemas IEEE30, IEEE118 e IEEE300 / Abstract: In this thesis presents a methodology for solving the optimal reactive power planning problem in inter- conected multi-area electric power systems, using the Dantzig-Wolfe technique. The original multi- area problem is separated into subproblems (one for each area) and a master problem (coordinator). The solution of the decomposed problem is based on the application of sucessive linear programming for solving the reactive planning subproblems in each area, and the coordination scheme is based on the reactive power marginal costs in the border bus. Thus the planning problem system is solved using a descentralized approach by regions or areas, where de transmission system operator in each area can planning the operation and expansion of its system regardless of the other areas, obtaining a optimal solution coordinated by descentralized in each area. The purpose of the mathematical model is to provide mechanism for develope the planning preserving the autonomy and confidentiality for each area, ensuring the economy of the overal multi-area full system. Using the mathematical model and computational implementation of the methodology proposed results are presented analisys and discussion of testes performed on three systems in three areas where each area is composed of three equal systems formed by IEEE30, IEEE118, and IEEE300 bus system / Mestre

abstract: During the 1960s, American youth were coming of age in a post–war period marked by an unprecedented availability of both money and leisure time. These conditions afforded young people new opportunities for exploring fresh ways of thinking and living, beyond the traditional norms of their parents' generation. Tom Wolfe recognized that a revolution was taking place, in terms of manners and morals, spearheaded by this latest generation. He built a career for himself reporting on the diverse groups that were developing on the periphery of the mainstream society and the various ways they were creating social spaces, what he termed “statuspheres,” for themselves, in which to live by their own terms. Using the techniques of the New Journalism—“immersion” reporting that incorporated literary devices traditionally reserved for writers of fiction—Wolfe crafted creative non–fiction pieces that attempted not only to offer a glimpse into the lives of these fringe groups, but also to place the reader within their subjective experiences. This thesis positions Wolfe as a sort of liminal trickster figure, who is able to bridge the gap between disparate worlds, both physical and figurative. Analyzing several of Wolfe's works from the time period, it works to demonstrate the almost magical way in which Wolfe infiltrates various radical, counterculture and otherwise “fringe” groups, while borrowing freely from elements across lines of literary genre, in order to make his subjects' experiences come alive on the page. This work attempts to shed light on his special ability to occupy multiple spaces and perspectives simultaneously, to offer the reader a multidimensional look into the lives of cultural outsiders and the impact that they had and continue to have on the overarching discussion of the American Experience. Ultimately, this paper argues that by exposing these various outlying facets of American culture to the mainstream readership, Wolfe acts as a catalyst to reincorporate these fringe elements within the larger conversation of what it means to be American, thereby spurring a greater cultural awareness and an expansion of the collective American consciousness. / Dissertation/Thesis / M.A. English 2014

This thesis explores what the role of the artist provides to the colonial novel. Using William Plomer's novel Turbott Wolfe, the role of the Western artist in colonial South Africa is examined and critiqued, putting it in conversation with the art theory of Roger Fry and the Primitivism movement. In doing so, it explores themes such as desire, miscegenation, complexity, and carnival, showing that while artists partake in society, they also remain critical of it, responding to it in their artwork.