Os longas-metragens \"Tabu\" (1982) e \"O mandarim\" (1995), de Julio Bressane, reinterpretam a história da canção popular brasileira de Mario Reis até a Tropicália, usando referências do modernismo e do próprio tropicalismo e questionando as influências populares, eruditas e estrangeiras da música brasileira. / Julio Bressanes films Tabu (1982) and O mandarim (1995) interpret the story of Brazilian popular music from Mario Reis until the Tropicália movement. The director uses Brazilian modernisms and Tropicalisms references to question the popular, the erudite and the foreigner influences in Brazilian music.

The thesis studies selected evolution systems to use in planning of high intensity focused ultrasound surgeries. Considered algorithms are statistically analyzed and compared by appropriate criteria to find the one that adds the most value to the potential real world medical problems.

This diploma thesis explores the area of sexuality of older people, summarizes previously published theoretical knowledge in this area and is complemented by empirical research. It deals with aging and outlines the changes that may occur in humans during this process, especially in terms of development and transformation of sexuality. This thesis also pursues the perception of senior sexuality by his surroundings and the general public. This thesis also partially covers the issue of institutional care for the elderly. Objective: Mapping of senior population's behaviors and attitudes towards sex and their comparison across genders. Methods: Research conducted by a quantitative survey. Processing and interpretation of data regarding to the relevant age groups, which are based on a survey of sexual behavior carried out in 2013 and guaranteed by Prof. PhDr. Petr Weiss, Ph.D. a Doc. MUDr. Jaroslav Zvěřina, CSc. from the Institute of Sexology, 1st Faculty of Medicine at Charles University, Results: More than a half of the senior population in the Czech Republic does not feel the need to sexually realize themselves. For women this phenomenon is represented more strongly than for men. If older people are living in a stable relationship, they are more likely to keep active sexual life. The average frequency...

In thesis "Explicit depictions of contemporary Japanese literature" I deal with contemporary prose literature describing problems of nowadays Japanese society. In the first part I define taboo and chose suitable novels for the need of this work. I focus on different types of characters - freeters, foreigners, social outsiders and victims. Next I take Murakami Ry's literature as an example of explicit depictions and show different ways of processing and various topics chosen by the author. Then I compare and contrast his work with selected prose of younger writer Kanehara Hitomi, who represents the literature of female authors in contemporary Japan. In conclusion I discuss the aesthetic function of literature of explicit depictions and its position in the field of art. By comparing and contrasting the various novels I reach my own characteristic of contemporary Japanese literature of explicit depictions.

Banca: Silvio Ikuyo Nabeta / Banca: José Aquiles Baesso Grimoni / Banca: Edson da Costa Bortoni / Banca: Oscar Armando Maldonado Astorga / Banca: Guilherme Eugênio Filippo Fernandes Filho / Resumo:Em um ambiente cada vez mais competitivo, as empresas de distribuição de energia elétrica devem satisfazer dois objetivos conflitantes: minimizar os custos de investimento e atender as metas de continuidade. A reconfiguração de sistemas de distribuição é uma técnica que se adapta a esse novo ambiente, pois permite a melhora de índices de confiabilidade apenas com a abertura e o fechamento de chaves, sem o ônus da aquisição de novos equipamentos. Devido à natureza de explosão combinatória do problema, na solução são empregados métodos metaheurísticos, que convergem para soluções ótimas ou quase ótimas, mas com um elevado esforço computacional. Como o objetivo principal deste trabalho é encontrar a(s) melhor(es) configuração(ões) do sistema de distribuição que apresentem os melhores índices de confiabilidade, a função objetivo utilizada para as metaheurísticas é minimizar o LOLC - Loss Of Load Cost (Custo da Perda de Carga), que está associado tanto com o número quanto a duração das interrupções de energia. Várias técnicas metaheurísticas são testadas, sendo que a Busca Tabu se mostrou a mais adequada para resolver o problema proposto. Para caracterizar computacionalmente o problema da reconfiguração das chaves foi desenvolvido um modelo vetorial (com números inteiros) da representação das chaves, onde cada chave normalmente aberta está associada a um grupo de chaves normalmente fechadas. Neste modelo foram introduzidas simplificações, para reduzir o tempo computacional, e restrições, para excluir soluções que não fornecem energia para algum ponto do sistema. Para verificar se existe violação nos critérios de tensão e carregamento é realizado um estudo de fluxo de potência para as dez melhores soluções encontradas ... (Resumo completo, clicar acesso eletrônico abaixo) / Abstract: In an ever more competitive environment, power distribution companies must satisfy two conflicting objectives: minimizing investment costs and the satisfaction of reliability targets. The network reconfiguration of a distribution system is a technique that well adapts to this new deregulated environment for it allows improvement of reliability indices only opening and closing switches, without the onus involved in acquiring new equipment. Due to combinatorial explosion problem characteristic, in the solution are employed metaheuristics methods, which converge to optimal or quasi-optimal solutions, but with a high computational effort. As the main objective of this work is to find the best configuration(s) of the distribution system with the best levels of reliability, the objective function used in the metaheuristics is to minimize the LOLC - Loss Of Load Cost, which is associated with both, number and duration of electric power interruptions. Several metaheuristics techniques are tested, and the tabu search has proven to be most appropriate to solve the proposed problem. To characterize computationally the problem of the switches reconfiguring was developed a vector model (with integers) of the representation of the switches, where each normally open switch is associated with a group of normally closed switches. In this model simplifications have been introduced to reduce computational time and restrictions were made to exclude solutions that do not supply energy to any load point of the system. To check violation of the voltage and loading criteria a study of power flow for the ten best solutions is performed. Also for the ten best solutions a reliability evaluation using Monte Carlo sequential simulation is performed, where it is possible to obtain the probability distributions of the indices and thus calculate the risk of ... (Complete abstract click eletronic access below)

<p style="text-align: justify;">У овом раду пажња је усмерена је на истраживање корпуса литерарног материјала еротске садржине, односно књижевно-уметничких текстова с елементима еротског,<br />који су обухваћени периодом од почетка осамнаестог до краја деветнаестог века. Циљ рада је редефинисање релевантаног корпуса еротске грађе у оквиру прозних и поетских књижевних текстова изабраног временског периода, те њихово прикључивање јединственом еротографском литерарном систему. Задатак и важност овог подухвата лежи у неопходности утврђивања позиције еротографије у српској књижевности, чије истраживање, разуме се, још увек није<br />завршено.<br />&nbsp;</p> / <p style="text-align: justify;">U ovom radu pažnja je usmerena je na istraživanje korpusa literarnog materijala erotske sadržine, odnosno književno-umetničkih tekstova s elementima erotskog,<br />koji su obuhvaćeni periodom od početka osamnaestog do kraja devetnaestog veka. Cilj rada je redefinisanje relevantanog korpusa erotske građe u okviru proznih i poetskih književnih tekstova izabranog vremenskog perioda, te njihovo priključivanje jedinstvenom erotografskom literarnom sistemu. Zadatak i važnost ovog poduhvata leži u neophodnosti utvrđivanja pozicije erotografije u srpskoj književnosti, čije istraživanje, razume se, još uvek nije<br />završeno.<br />&nbsp;</p>

As technology scales down and CMOS circuits are powered by lower supply voltages, standby leakage current becomes significant. A behavioral level framework for the synthesis of data-paths with low leakage power is presented. There has been minimal work done on the behavioral synthesis of low leakage datapaths. We present a fast architectural simulator for leakage (FASL) to estimate the leakage power dissipated by a system described hierarchically in VHDL. FASL uses a leakage power model embedded into VHDL leafcells. These leafcells are characterized for leakage accurately using HSPICE. We present results which show that FASL measures leakage power significantly faster than HSPICE, with less than a 5% loss in accuracy, compared to HSPICE. We present a comprehensive framework for synthesizing low leakage power data-paths using a parameterized Multi-threshold CMOS (MTCMOS) component library. The component library has been characterized for leakage power and delay as a function of sleep transistor width. We propose four techniques for minimization of leakage power during behavioral synthesis: (1) leakage power management using MTCMOS modules; (2) an allocation and binding algorithm for low leakage based on clique partitioning; (3) selective binding to MTCMOS technology, allowing the designer to have control over the area overhead; and (4) a performance recovery technique based on multi-cycling and introduction of slack, to alleviate the loss in performance attributed to the introduction of MTCMOS modules in the data-path. Finally, we propose two iterative search based techniques, based on Tabu search, to synthesize low leakage data-paths. The first technique searches for low leakage scheduling options. The second technique simultaneously searches for a low leakage schedule and binding. It is shown that the latter technique of unified search is more robust. The quality of results generated bytabu-based technique are superior to those generated by simulated annealing (SA) search technique.

In this thesis, a new tool, named CHESS, is designed and developed for control and data-flow graph (CDFG) extraction and the high-level synthesis of VLSI systems. The tool consists of three individual modules for:(i) CDFG extraction, (ii) scheduling and allocation of the CDFG, and (iii) binding, which are integrated to form a comprehensive high-level synthesis system. The first module for CDFG extraction includes a new algorithm in which certain compiler-level transformations are applied first, followed by a series of behavioral-preserving transformations on the given VHDL description. Experimental results indicate that the proposed conversion tool is quite accurate and fast. The CDFG is fed to the second module which schedules it for resource optimization under a given set of time constraints. The scheduling algorithm is an improvement over the Tabu Search based algorithm described in [6] in terms of execution time. The improvement is achieved by moving the step of identifying mutually exclusive operations to the CDFG extraction phase, which, otherwise, is normally done during scheduling. The last module of the proposed tool implements a new binding algorithm based on a game-theoretic approach. The problem of binding is formulated as a non-cooperative finite game, for which a Nash-Equilibrium function is applied to achieve a power-optimized binding solution. Experimental results for several high-level synthesis benchmarks are presented which establish the efficacy of the proposed synthesis tool.

There are many combinatorial optimization problems such as traveling salesman problem, quadratic-assignment problem, flow shop scheduling, that are computationally intractable. Tabu search based simulated annealing is a stochastic search algorithm that is widely used to solve combinatorial optimization problems. Due to excessive run time, there is a strong demand for a parallel version that can be applied to any problem with minimal modifications. Existing advanced and/or parallel versions of tabu search algorithms are specific to the problem at hand. This leads to a drawback of optimization only for that particular problem. In this work, we propose a parallel version of tabu search based SA on the Graphics Processing Unit (GPU) platform. We propose two variants of the algorithm based on where the tabu list is stored (global vs. local). In the first version, the list is stored in the global shared memory such that all threads can access this list. Multiple random walks in solution space are carried out. Each walk avoids the moves made in rest of the walks due to their access to global tabu list at the expense of more time. In the second version, the list is stored at the block level and is shared by only the block threads. Groups of random walks are performed in parallel and a walk in a group avoids the moves made by the rest of the walks within that group due to their access to shared local tabu list. This version is better than the first version in terms of execution time. On the other hand, the first version finds the global optima more often. We present experimental results for six difficult optimization functions with known global optima. Compared to the CPU implementation with similar workload, the proposed GPU versions are faster by approximately three orders of magnitude and often find the global optima.

La superposition de topologies virtuelles à la topologie physique d'un réseau est un des principaux mécanismes de l'ingénierie de trafic. Soit un réseau physique d'une certaine topologie et capacité fixées et une matrice de trafic à véhiculer, il s'agit trouver une topologie logique permettant de mapper de manière optimale la matrice de trafic sur le réseau physique. Lors de l'évolution de la matrice de trafic sur des échelles de temps longues, il faudra agir sur le layout. La première contribution concerne la définition de fonctions de coût mieux adaptées à la réalité d'un opérateur, la deuxième contribution concerne la prise en compte du coût de changement du layout. Il s'avère intéressant d'un point de vue opérateur de réduire la complexité du layout, mesurée comme une fonction du nombre de chemins virtuels. Nous avons donc formulé divers problèmes de minimisation de la complexité du layout sous des contraintes de QoS. Il s'agit d'une modélisation réaliste mais qui engendre des modèles difficiles à résoudre. Nous avons développés des heuristiques qui permet de trouver des solutions approchées pour des réseaux de grande taille. Nous avons montré que la complexité des layouts peut être significativement réduite en comparaison avec celle obtenue suite à l'optimisation des fonctions de coût classiques. Le changement du layout implique d'une part un coût d'opération et d'autre part peut engendrer des coupures de service qui affecteront directement le coût d'opération. Nous avons formulé une famille de problèmes prenant en compte le coût de reconfiguration du layout. L'une des heuristiques citées a été adaptée pour analyser ces nouveaux problèmes.