Дисертації: "TAB2"

1

Шелест, Ігор Владиславович, Игорь Владиславович Шелест, Ihor Vladyslavovych Shelest, Ярослав Олегович Кравченко, Ярослав Олегович Кравченко, Yaroslav Olehovych Kravchenko, Володимир Володимирович Буранич, Владимир Владимирович Буранич, Volodymyr Volodymyrovych Buranych та Д. Ю. Бровко. "Аналіз впливу параметрів магнетронного розпилення на формування наноструктурних покриттів TaB2". Thesis, Сумський державний університет, 2018. http://essuir.sumdu.edu.ua/handle/123456789/67912.

Повний текст джерела

Анотація:

Тонкі покриття на основі боридів перехідних металів мають високу температуру плавлення та твердість, і знайшли широкий діапазон використання у різних галузях промисловості, за рахунок ефективного підвищення захисних властивостей. Для нанесення даних покриттів високу популярність здобув метод нереактивного магнетронного розпилення композиційних мішеней за участю іонного бомбардування, за рахунок високої варіативності в плані регулювання параметрів.

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Cabanillas, Arredondo Dennis Leonardo, Gonzáles Maydee Aracely Hernández, Artica Daniel Inocente, Vargas Yessenia Pilar Najarro, and Luna Aldair Erlan Nestares. "Tabú Planner." Bachelor's thesis, Universidad Peruana de Ciencias Aplicadas (UPC), 2019. http://hdl.handle.net/10757/626655.

Повний текст джерела

Анотація:

En el presente documento se detalla un proyecto que ha sido desarrollado durante varios meses, en donde se investigó rigurosamente el mercado y se determinó la viabilidad de este. El proyecto, llamado Tabú Planner, es una página web que servirá de intermediario entre una concentración diversificada de microempresarios proveedores de diferentes servicios para realizar eventos y miles de personas que tienen la necesidad de realizar un evento en específico. Esta página consiste en conectar a los microempresarios que no tienen un lugar determinado donde promocionar sus servicios y al usuario quien tampoco conoce proveedores para realizar su evento; se realizó la validación y se obtuvo como resultado que invierten mucho tiempo en la búsqueda, e incluso no los encuentran en las condiciones que ellos esperaban. Nosotros, como compañía, somos ese nexo importante para que las necesidades de ambos puedan suplirse. Para la inversión inicial se requerirá un importe de S/33,050 soles, el cual será aportada mayoritariamente por los accionistas, pero un importe menor será por tercero. Las fuentes de ingresos serán mediante el pago de membresías que irán desde los tres meses hasta los doce meses. Además, se contará con una oficina que servirá para tener un contacto directo con nuestros socios claves. Con respecto a la evaluación financiera, el negocio genera un Valor Presente Neto de 46,841.19. La TIR del proyecto asciende a 13%, con un retorno de inversión a partir del 1.76 años.
This document details our Project that has been developed throughout the past five months, in which we investigated the market and determined its viability. The project is called “Tabú Planner”, which is a website that serves as an intermediary between a diversified market of small entrepreneurs that provide different services related to the organization of events, and thousands of people who have the need to organize a specific event. This website relays to connect those entrepreneurs that doesn’t develop a promotion strategy in which the sell their products and those customers that doesn’t know which are the best providers. We realized the validation, and it resulted that customers waste too much time finding the suitable one, and even in the case they find them, it often doesn’t fulfill their expectations. Our company is the suitable relation to fulfill those necessities. For the initial investment, the amount of S/ 33,050 is needed, which will be mostly contributed by the shareholders, but a small margin will be invested by a third party. The income stream will be made through the payment of memberships that will offered from three months to twelve months. In addition, there is an office that serves to have direct contact with our key partners. Related to our financial evaluation, this project generates a Net Present Value of 46,841.19. The project’s TIR amount to 13% with a return over investment starting at 1.76 years.
Trabajo de investigación

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Whittley, Ian Murray. "Tabu search-revisited." Thesis, University of East Anglia, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.251720.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Albarracín, Sánchez Lucía Venecia, Reynoso Jessica Alessandra Palomino, León Luis Fabian Paredes, Saavedra Enrique Jean Pierre Sigueñas, and Neciosup Fernando Manuel Velasquez. "Lava tu taba." Bachelor's thesis, Universidad Peruana de Ciencias Aplicadas (UPC), 2020. http://hdl.handle.net/10757/652887.

Повний текст джерела

Анотація:

Las zapatillas se han convertido en una de las prendas más importantes y preferidas por los consumidores. Así lo muestra ADEX, en su portal Data Trade (2020), en donde se identifica un crecimiento promedio, en los últimos tres años, del 35% en las importaciones de este calzado. Esta preferencia no se traduce a un simple gusto, sino va más allá al convertirse en una cultura, con consumidores más apasionados, perseguidores de nuevos lanzamientos y coleccionistas de ediciones limitadas. Por ende, brindan tiempo y dedicación en brindarles el cuidado adecuado. Ante esta necesidad, nace Lava Tu Taba, una solución para la limpieza especializada y cuidado de zapatillas. La propuesta combina la limpieza cuidadosa del calzado, con un sistema integral de delivery y el uso de tecnologías que permitirá reducir tiempos a nuestros clientes, así como brindarles seguridad necesaria al brindar un seguimiento completo a sus productos al ser tratados. Nuestro segmento son personas entre los 20 y 40 años ubicados en Lima Moderna y con un estilo de vida sofisticado. El proyecto cuenta con un crecimiento anual promedio proyectado del 27.3% y una demanda anual inicial de aproximadamente 11,000 servicios. El proyecto cuenta con una inversión inicial de S/ 82,427, la cual tendrá un financiamiento del 30%. Y presenta un VPN de S/146,145, TIR de 51.87%, IR de 2.79 y PRI 3.77 años, lo cual confirma su viabilidad financiera, para los 5 años de horizonte de tiempo.
Sneakers have become one of the most important and preferred garments by consumers. This is shown by ADEX, on its Data Trade portal (2020), where an average growth of 35% in imports of this footwear is identified in the last three years. This preference does not translate to simple taste, but goes further by becoming a culture, with more passionate consumers, persecutors of new releases and collectors of limited editions. Therefore, they give time and dedication to provide them with the proper care. Given this need, Lava Tu Taba was born, a solution for specialized cleaning and care of slippers. The proposal combines the careful cleaning of footwear, with a comprehensive delivery system and the use of technologies that will reduce our customers' time, as well as provide them with the necessary security by providing complete monitoring of their products when they are treated. Our segment is people between 20 and 40 years old located in Modern Lima and with a sophisticated lifestyle. The project has a projected average annual growth of 27.3% and an initial annual demand of approximately 11,000 services. The project has an initial investment of S / 82,427, which will have a financing of 30%. And it presents a NPV of S / 146,145, IRR of 51.87%, IR of 2.79 and PRI 3.77 years, which confirms its financial viability, for the 5-year time horizon.
Trabajo de investigación

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Viola, Cristina. "Biochemical studies of human TBP-associated factor TAF2 and a TAF2 and a TAF2-8-10 subcomplex of human general transcription factor TFIID." Thesis, Grenoble, 2014. http://www.theses.fr/2014GRENV072/document.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Pureza, Vitoria M. M. "Abordagens adaptativas de metaheuristicas tabu." [s.n.], 1996. http://repositorio.unicamp.br/jspui/handle/REPOSIP/261048.

Повний текст джерела

Анотація:

Orientador: Paulo Morelato França
Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-07-22T22:52:02Z (GMT). No. of bitstreams: 1 Pureza_VitoriaM.M_D.pdf: 9869285 bytes, checksum: 3d30f5f94e19c47fb41416cb14190a97 (MD5) Previous issue date: 1996
Resumo: A Busca Tabu é um procedimento heurístico de orientação da busca com vistas à obtenção de boas soluções em problemas de dificil tratamento. Fundamentalmente, ela é caracterizada por mecanismos que promovem a superação da otimalidade local. Esses mecanismos geralmente tomam a forma de parâmetros que impõem restrições à seleção de movimentos. Como a calibragem desses elementos restritivos tem um impacto fundamental no desempenho do algoritmo, algumas implementações utilizam estratégias que provocam alterações sistemáticas nos valores de determinados parâmetros. Estas estratégias procuram intensificar a exploração de regiões promissoras e o abandono de regiões onde possibilidades de melhoria parecem mínimas. As alterações nos valores dos parâmetros são normalmente acionadas por fases de busca caracterizadas pela ausência de movimentos de atualização da solução incumbente. O objetivo principal deste trabalho é o de propor uma nova abordagem adaptativa de metaheurísticas Tabu. A abordagem HTA, aqui considerada, propõe que a alteração de parâmetros seja determinada a partir da identificação de padrões da trajetória de busca recentemente traçada. Estes padrões fornecem indicações, ainda que limitadas, acerca da topologia do espaço de soluções. Para cada padrão, são aplicadas perturbações nos valores de parâmetros tabu selecionados, como forma de adaptar a busca às diferentes condições encontradas. A abordagem HTA foi desenvolvida a partir de extensos experimentos com o Problema do Caixeiro Viajante Simétrico e Euclideano (PCV). Testes envolveram 12 instâncias clássicas e verificaram ganhos significativos em relação à versão não-adaptativa, mesmo sob condições operacionais estressantes impostas por parâmetros mantidos fora de controle. A seguir, a mesma abordagem foi aplicada ao Problema de Roteamento de Veículos (PRV). Neste trabalho, apresentamos os resultados obtidos com 14 instâncias clássicas caracterizadas por diferentes restrições. Os resultados foram comparados com os de três algoritmos altamente competitivos e indicaram que HTA produz soluções de qualidade comparável aos demais. São também apresentados os resultados obtidos com uma implementação adaptativa HTA para o Problema de Agrupamento Capacitado (PAC). Os resultados, mais uma vez, sugerem que a introdução de mecanismos adaptativos baseados em padrões da trajetória da busca é uma estratégia robusta e promissora
Abstract: Tabu Search (TS) is a general heuristic procedure for guiding search to obtain good solutions in complex solution spaces. Fundamentally, it is characterized by mechanisms that allow the exploration of the solution space beyond local optimality. These mechanisms are generally implemented by means of parameters which impose restrictions to move selection. Since the calibration of such restrictive elements has a major impact on the algorithm's performance, some implementations use strategies for altering the values of these parameters whenever non-improving search phases are verified. Essentially, these strategies seek to intensify the exploration of promising regions of the solution space, and to abandon the search in regions where improvement possibilities seem to be minimal. The main purpose ofthis work is to propose a new adaptive Tabu metaheuristic approach. The HTA approach, considered here, assumes that the alteration of the parameters values should be defined first by identifying specific pattems in the search trajectory recently described. These pattems provide indications of the solution space topology. For each pattem, perturbation on the values of selected tabu parameters is applied, as means to adapt the search to the different conditions found. The HTA approach was developed from extensive experiments with the Symmetric and Euclidean Traveling Salesman Problem (TSP). Tests involved 12 benchmark instances and verified improvements with respect to a non-adaptive implementation, even under stressing operational conditions provided by free-Junning parameters. HTA was also applied to the Vehicle Routing Problem (VRP). We present the results obtained for 14 benchmark instances characterized by different restrictions. Our adaptive implementation is compared to three highly competitive algorithms. The results indicate that HTA is able to provide solution quality levels comparable to the other algorithms. We also present the results provided by an HTA implementation for the Capacitated Clustering Problem (CCP). They also suggest that introducing adaptive mechanisms based on the pattems of search trajectories is a robust and promising strategy
Doutorado
Doutor em Engenharia Elétrica

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Silva, Juliana Simões e. "Algoritmos baseados em busca tabu e busca tabu reativa para problemas generalizados de programação de projetos." [s.n.], 2004. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260182.

Повний текст джерела

Анотація:

Orientador: Vinicius Amaral Armentano
Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-04T02:52:54Z (GMT). No. of bitstreams: 1 Silva_JulianaSimoese_M.pdf: 629718 bytes, checksum: ceb1677c1d500c414d75ed2eb8112ad7 (MD5) Previous issue date: 2004
Resumo: O problema clássico de programação de projetos com restrição de recursos consiste de atividades, sujeitas a relações de precedência, que têm duração fixa e competem por recursos limitados. Este problema envolve a determinação do instante de início das atividades com o objetivo de minimizar o tempo de término do projeto. Diversas extensões do problema clássico têm sido consideradas na literatura para modelar problemas reais. Uma destas extensões é o problema abordado neste trabalho, denominado problema generalizado de programação de projetos com restrição de recursos. O problema generalizado considera duas extensões do problema clássico. A primeira envolve relações de precedência representadas por intervalos mínimos de tempo entre início de duas atividades, que são importantes em ambientes de produção ¿make-to-order¿, quando existe um tempo de preparação de máquina independente da seqüência entre duas atividades. A segunda extensão consiste de disponibilidade de recursos variante no tempo, que incorpora situações em que somente um subconjunto do total da mão-de-obra ou de máquinas está disponível devido a férias ou manutenção. Devido à alta complexidade combinatória do problema, utilizam-se métodos heurísticos para a resolução de problemas de porte real. Algoritmos que combinam conceitos de busca tabu e busca tabu reativa são propostos e implementados computacionalmente. O desempenho destes é comparado com um algoritmo de busca tabu reativa da literatura
Abstract: The classical resource constrained project scheduling problem consists of activities with fixed duration and subject to precedence relations, which compete for limited resources. This problem involves the determination of the starting time of the activities in order to minimize the completion time of the project. Several extensions of the classical problem have been addressed in the literature to model real problems. One of these extensions is the problem tackled in this work, named generalized resource constrained project scheduling problem. The generalized variant considers two extensions in relation to the classical problem. The first one involves the representation of precedence relations among activities, by means of a minimum time interval between two activities, which is important in the make-to-order production setting, when a machine setup time is incurred between the processing of two activities. The second extension considers that the resource availability is time varying, which represents the situation where only a subset of the total manpower and machines is available due to vacation or maintenance. Due to the high combinatorial complexity of this problem, heuristic methods are used to solve real size problems. Algorithms that combine concepts from tabu search and reactive tabu search are proposed and computationally implemented. Their performance is tested against a reactive tabu search algorithm from the literature
Mestrado
Automação
Mestre em Engenharia Elétrica

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Slomka, Frank. "Mehrkriterienoptimierung verteilter Echtzeitsysteme mit Tabu-Search /." Düssdeldorf : VDI-Verl, 2002. http://www.gbv.de/dms/bs/toc/35430979x.pdf.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Heathcote, Daniel. "Aerodynamic loads control using mini-tabs." Thesis, University of Bath, 2017. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.760920.

Повний текст джерела

Анотація:

Aircraft encounter increased aerodynamic loads when exposed to gusts, turbulence andmanoeuvres. Currently, these loads are mitigated through the use of ailerons and spoilers to reduce lift, in turn reducing the loads passed to the aircraft structure. However, these actuators are limited in their frequency response and cannot control loads produced by higher frequency events. Therefore, an actuator which can mitigate high frequency oscillatory loads is required, with a deployment reduced frequency, k of up to 1. One such promising load control actuator is the minitab, consisting of a small span-wise strips, similar to the Gurney flap, deployed normal to the airfoil upper surface. Key to the actuator’s high frequency response is its low inertia, meaning that a small energy input can achieve a significant effect. To investigate the efficacy of the minitab on load alleviation a series of steady state, periodic and transient measurements were conducted at a Reynolds number of 6.6 x 105. These experiments aimed to fully evaluate the effect of chordwise location, mini-tab height and angle of attack on steady state load control. The dynamic response was categorised, in terms of magnitude, phase and time delay by the periodic and transient measurements. Mini-tabs of height h/c = 0.02 and 0.04 were employed in a steady state configurationacross a range of chordwise locations to investigate the effects of mini-tab height and chordwise position. Overall, the mini-tab was found to have a lift reducing effect which increased with height. It was found that the effect of the chordwise location was highly dependent on the angle of attack. Placement close to the trailing edge induced a large effect at α = 0°, creating an effective change in camber comparable to conventional Gurney flap use. Peak suction over the lower surface increased resulting in a reduction of ΔCL = -0.48. Approaching stall, effectiveness decreased as the mini-tab became immersed in the separated flow. Placement at xf/c = 0.60 produced an almost constant lift reduction between α = 0° and 5° of ΔCL ≈ -0.60, with a gradual reduction to stall. A mini-tab positioned close to the leading edge (xf/c = 0.08) was found to separate the flow effectively at low incidences but with no noticeable change in lift observed. It was found that the flow separation produced by the mini-tab effectively eliminated the suction peak on the upper surface. However, placement close to the leading edge has increasing effectiveness towards stall, as the shear layer induced by the separation was displaced further from airfoil surface. Peak lift reduction at stall was found to be ΔCL ≈ -0.67. The optimum chordwise location for peak lift reduction is dependent on the airfoil angle of attack: the position of the mini-tab for maximum lift reduction moves towards the leading edge as the angle of attack increases. The second stage utilised a deployable mini-tab up to reduced frequencies, k = 0.79, placedat xf/c = 0.85, to assess the mini-tab’s frequency response. The force measurements indicate that the mini-tab has a decreasing effect on lift reduction with increasing actuation frequency. This trend is comparable to Theodorsen’s function, based on the change in circulation. For α = 0°, the normalised peak-to-peak lift reduction decreased from 1 for steady state deployment to around 0.6 at k = 0.79. In addition, a phase lag exists between the mini-tab deployment and the aerodynamic response which increased with actuation reduced frequency, k. However, the measured phase lag is substantially larger than Theodorsen’s prediction. Increasing the angle of attack, α reduced the mini-tab’s effect on lift while increasing the phase angle when comparing equal k values. Particle Image Velocimetry measurements indicate that the delay and reduction in effectiveness of periodic deployment is due to the presence and growth of the separated region behind the mini-tab. Overall, the mini-tab was found to be an effective, dynamic lift reduction device with the separated region behind the mini-tab key to the amplitude and phase delay of lift response. Finally, the aerodynamic response of the mini-tab was investigated during a transientdeployment. The delay in aerodynamic response to mini-tab actuation was consistent with literature. The normalised deployment period, τdeploy did not provide a significant alteration in the aerodynamic response for deployment periods below τdeploy = 3, with the aerodynamic response reaching the steady state value around τ = 6-8. The aerodynamic response of the mini-tab was approximated using a simple, 1st order system response to a ramp-step input of gradient 1/τdeploy, indicating that the aerodynamic response of the mini-tab is further delayed for higher angles of attack, due to the presence of separated flow in the vicinity of the mini-tab. PIV measurements were utilised to analyse the effect of transient mini-tab deployment, indicating a delay in the development of the separation region created by the mini-tab, producing a corresponding delay in aerodynamic response. In addition, outward deployment was found to have a slower aerodynamic response than inward deployment, as the flow was found to take to detach slower than to reattach.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Furtado, João Carlos. "Otimização de leiaute utilizando busca tabu." Instituto Nacional de Pesquisas Espaciais (INPE), 1995. http://urlib.net/sid.inpe.br/iris@1905/2005/07.29.00.20.

Повний текст джерела

Анотація:

A busca de melhores leiautes é um problema de otimizacao combinatoria que surge em uma grande variedade de contextos de planejamento espacial, como no leiaute de departamentos em uma industria. Como nao existe algoritmo de otimizacao conhecido que obtenha uma solucao otima global em tempo polinomial, usam-se metodos heuristicos. Estudamos o assunto aplicando a seguinte sequencia de passos para um dado problema: 1) Geramos uma solucao inicial atraves do procedimento de aglomeracao; 2) Geramos uma outra solucao inicial, recolocando as facilidades aleatoriamente; 3) Aplicamos a busca tabu as duas solucoes iniciais geradas; 4) Comparamos os resultados obtidos no passo 3. Este procedimento é aplicado a quatro casos: os de 12, 15, 20 e 30 facilidades. No espaco destinado a alocacao das facilidades ja existiam areas ocupadas e que nao podiam ser utilizadas pelas facilidades, o que aumentou consideravelmente a dificuldade de tratamento do problema. Comparando os leiautes iniciais produzidos no passo 1 com os produzidos no passo 2, concluimos que o procedimento de aglomeracao gerou leiautes iniciais de melhor qualidade. No passo 4, percebemos que a busca tabu, quando aplicada a solucao inicial produzida pelo passo 1, gera leiautes finais de qualidade ligeiramente superiores aos obtidos, quando este procedimento é aplicado a solucao inicial produzida pelo passo 2. Concluimos que independentemente da qualidade da solucao inicial, a busca tabu é uma heuristica eficiente no processo de busca.
The search of better layouts is a combinatorial optimisation problem that arises in a wide variety of spacial planning contexts, in looking for a Layout of departments industry. Since no polinomial-time algorithm for attainning a global optimal solution is known some heuristics techniques are used. We study this subject, for a given problem, performing the following steps: 1) We generate an initial solution by using a clustering procedure; 2) We generate another initial solution, rearranging them randomly; 3) We apply the tabu search to the two initial solutions generated above; 4) We compare the results obtained in the step 3. The procedure is applied to four cases, namely, those with 12, 15, 20 and 30 facilities. In the space assigned to facilities there were occupied areas and the facilities cannot be used there, so we increased the difficulty of the problem. When we compared the initial layouts obtained in step 1 with the obtained in step 2, we conclued that step 1 obtained better layouts. From step 4, we conclued that the tabu search obtained sligthly better final layouts when applied to initial solutions generated in step 1 than those obtained starting from solutions generated in step 2. So we conclude that tabu search is an efficient search procedure independent of the quality of the initial solution.

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Giera-Pander, Aleksandra. "Transgresje tabu w New French Extremity." Doctoral thesis, Katowice : Uniwersytet Śląski, 2014. http://hdl.handle.net/20.500.12128/5738.

Повний текст джерела

Анотація:

Pracę chciałabym podzielić na dwie części. Pierwszej nadać charakter terminologiczny i systematyczny. Istotną kwestią będzie w niej zebranie informacji na temat definicji transgresji, rozumienia i ewolucji jej znaczenia. Postaram się przybliżyć stanowiska badaczy, kształtujące się na przestrzeni lat. Chciałam przedstawić różne podejścia naukowców, autorów i badaczy, ich interpretacje i ocenę koncepcji transgresji, a przy tym wyłonić rys historyczny. W części teoretycznej chciałam zawrzeć również najważniejsze koncepcje dotyczące zagadnień transgresyjnych, które pojawiły się także (oprócz akademickiego) na gruncie literackim. W mojej pracy równie istotnym zadaniem będzie charakterystyka i opis zjawiska New French Extremity. Chciałabym zebrać i skatalogować informacje o przebiegu działalności reżyserów związanych z New French Extremity. Przedstawić sylwetki twórców i ich specyficzną, autorską wizję kina i drogę do „filmowej ekstremy”, którą rozumieją bardzo indywidualnie. Udowodnić, że marginalizowana tendencja w kinie francuskim przyczyniła się do rozprzestrzenienia i pokazywania (kopiowania?) zjawiska w kinie europejskim, a nawet światowym. W drugiej części, analitycznej chciałbym poprzez subiektywny wybór filmów przedstawić jak wygląda kwestia podejścia do (antropologicznego) tabu, jego odważnego przekraczania (tożsamego z transgresją) zmian jakie nastąpiły w wyniku postępu cywilizacji. Równocześnie żeby móc „przekraczać” należy określić granice, normy, ramy, systemy społeczne – te chciałabym spróbować wyłonić z antropologii, historii kultury i cywilizacji oraz europejskiej tradycji. W części analitycznej chciałabym poruszyć również te najbardziej nurtujące i kontrowersyjne kwestie, najczęściej odsłanianie przez francuskich reżyserów, a zarazem będące wyznacznikiem Nowej Francuskiej Ekstremy – seksualność, przemoc, przemoc seksualna, odmieńców, śmierć, relacje kazirodcze, kanibalizm. Skonfrontować je z wybranymi obrazami, formą prezentacji i interpretacją sugerowaną przez samych twórców, przedstawicieli New French Extremity. Oprócz charakteru akademickiego chciałabym, by moja praca była refleksją na temat zmian mentalności człowieka, pytaniem o etykę ludzką, o granice kultury, o proces dehumanizacji, wyzbycia się ograniczeń moralnych oraz o kierunek, którym podąża człowiek, a w ślad za nim kino.

Стилі APA, Harvard, Vancouver, ISO та ін.

12

SHARMA, VIKAS. "QUANTITATIVE ANALYSIS OF TABU SEARCH ALGORITHM FOR A VLSI PLACEMENT APPLICATION." University of Cincinnati / OhioLINK, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=ucin990820742.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Burks, Andrea Nia. "USERNAME TAB PASSWORD RETURN." VCU Scholars Compass, 2009. http://scholarscompass.vcu.edu/etd/1815.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Mijuskovic, Martina. "Structural and biochemical studies on human TAF2 /." Zürich : ETH, 2007. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=17313.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Simaitis, Rokas. "Iteratyviosios tabu paieškos algoritmo komivojažieriaus uždaviniui tyrimas." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2006. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2006~D_20060602_173228-37727.

Повний текст джерела

Анотація:

In this work, the iterated tabu search (ITS) algorithm for the traveling salesman problem (TSP) is discussed. The TSP is a well-known combinatorial optimization problem. Thus, solving the TSP means searching for the shortest closed tour in which every city is visited exactly once. Various heuristic algorithms can be used for solving the TSP, among them, tour construction heuristics, simulated annealing, genetic algorithms, etc. One of the promising heuristic techniques is the iterated tabu search approach. ITS consists of two main parts: standard tabu search (TS) and mutation of solutions. The goal of TS is finding a locally optimal solution in the neighbourhood of the current solution, while the mutation operators are responsible for escaping from the current local optimum and moving towards new regions in the solution space. Several mutation procedures have been analyzed in this work, in particular, exchange mutation, insert mutation, inversion mutation, and others. In order to investigated the performance of the mutation operators, computational experiments with the test instances from the TSP instances library TSPLIB were carried out. The results obtained from these experiments show that the mutation operators play the important role and influence the solution quality significantly.

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Al-Hamad, Khaled. "Tabu search for ship routing and scheduling." Thesis, Brunel University, 2006. http://bura.brunel.ac.uk/handle/2438/5071.

Повний текст джерела

Анотація:

This thesis examines exact and heuristic approaches to solve the Ship Routing and Scheduling Problem (SRSP). The method was developed to address the problem of loading cargos for many customers using heterogeneous vessels. Constraints relate to delivery time windows imposed by customers, the time horizon by which all deliveries must be made and vessel capacities. The objective is to minimise the overall operation cost, where all customers are satisfied. Two types of routing and scheduling are considered, one called single-cargo problem, where only one cargo can be loaded into a ship, and the second type called multi-cargo problem, where multiple products can be carried on a ship to be delivered to different customers. The exact approach comprises two stages. In the first stage, a number of candidate feasible schedules is generated for each ship in the fleet. The second stage is to model the problem as a set partitioning problem (SPP) where the columns are the candidate feasible schedules obtained in the first stage. The heuristic approach uses Tabu Search (TS). Most of the TS operations, such as insert and swap moves, tenure, tabu list, intensification, and diversification are used. The results of a computational investigation are presented. Solution quality and execution time are explored with respect to problem size and parameters controlling the tabu search such as tenure and neighbourhood size. The results showed that the average of the solution gap between TS solution and SPP solution is up to 28% (for small problems) and up to 18% for large problems. However, obtaining an optimal solution requires a large amount of computer time to produce the solution compared to obtaining approximate solutions using the TS approach. The use of Tabu Search for SRSP is novel and the results indicate that it is viable approach for large problems.

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Braga, Gisele Pandolfo. "Espiritualidade no divã : do tabu à universidade." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2014. http://hdl.handle.net/10183/94891.

Повний текст джерела

Анотація:

A partir do advento da Modernidade, a racionalidade extrema imposta pelo paradigma cartesiano fez com que a espiritualidade passasse a ser desacreditada e praticamente expulsa da realidade do homem ocidental. Porém, percebe-se que, aos poucos, ela vem retomando seu espaço e conquistando o respeito de diversos pesquisadores. Esta tese tem por objetivo investigar a espiritualidade como fenômeno em ascensão na sociedade brasileira atual. Para tanto, aborda a valorização da dimensão espiritual do ser humano a partir da atuação de núcleos de espiritualidade inseridos em universidades publicas brasileiras. Dentro de uma abordagem fenomenológico-hermenêutica, a partir de unidades significativas que emergiram dos depoimentos de pessoas vinculadas a esses núcleos, investiga a sua criação, suas dificuldades e seu campo de atuação a fim de compreender como se dá o atravessamento da espiritualidade no meio acadêmico. Paralelamente a esta investigação, esta tese estabelece um diálogo com a filosofia de Platão, Descartes e Spinoza a fim de ilustrar pontos determinantes da trajetória histórica da espiritualidade e resgatar alguns conceitos importantes para a discussão do tema. Também recorre à teoria psicanalítica de Freud e Lacan, a fim de compreender, por um lado, em que bases se deu a exclusão da espiritualidade por parte da Psicanálise e, por outro, onde pode estar apoiado o fenômeno de insistência e persistência da busca do homem pelo sagrado. A partir dos resultados da investigação, dentro do modelo dos quatro discursos elaborado por Lacan, busca analisar o efeito que o paradigma da espiritualidade tem sobre o discurso das universidades que o assumem e propõe a implementação de uma ação pedagógica de abordagem integral nas instituições de ensino básico. Os achados deste trabalho indicam que, embora a Psicanálise tenha rejeitado a religião, ela está aberta a outras formas de expressão da espiritualidade e que a clínica do Real de Lacan guarda semelhança com práticas espirituais de origem oriental. Os dados empíricos confirmam a espiritualidade como fenômeno em ascensão na sociedade brasileira atual e demonstram que, através da entrada da espiritualidade no espaço universitário, este tema vem atestando sua validade tanto como foco de pesquisa, quanto como prática médica e educativa. Porém, sua presença na academia ainda sofre preconceitos.
Since the advent of Modern Time, spirituality has been discredited and nearly expelled from Western man’s reality due to the extreme rationality imposed by the Cartesian paradigm. However, it is possible to observe that, gradually, it has been recovering its space and gaining respect among several researchers. This thesis aims at investigating spirituality as a rising phenomenon in present-day Brazilian society. In order to do that, it approaches the valorization of human being’s spiritual dimension based on groups of spirituality which exist inside Brazilian public universities. In the scope of the phenomenological-hermeneutic approach, according to the significant units which emerged from the interviews made with people who belong to these groups, this work investigates their creation, difficulties and field of action in order to understand the crossing of spirituality in the academic environment. Along with this investigation, this thesis establishes a dialogue with Plato, Descartes and Spinoza’s philosophy in order to illustrate determining points for the discussion of the theme. It also evokes Freud and Lacan’s psychoanalytic theory to understand, on the one side, the terms in which the exclusion of spirituality from Psychoanalysis happened and, on the other side, where the support for the insistence and persistence of man’s seek for the sacred can be found. Based on Lacan’s model of the four discourses, it tries to analyze the effect the spirituality paradigm causes in the discourse of the universities which accept and proposes the implementation of a pedagogical action based on the integral approach in elementary and high school. The findings of this thesis indicate that, although Psychoanalysis has rejected religion, it is open to other forms of expression of spirituality and that Lacan’s clinic of the real shows some similarities to some Eastern spiritual practices. The empiric data confirm spirituality as a rising phenomenon in the present-day Brazilian society and demonstrate that, with the entrance of spirituality in the university space, this theme has been testifying its validity as a research subject as well as medical and educational practice. However, its presence in the university still suffers prejudice.

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Cruz, António Manuel Costa. "IMRT beam angle optimization using Tabu search." Master's thesis, Universidade de Aveiro, 2014. http://hdl.handle.net/10773/17714.

Повний текст джерела

Анотація:

Mestrado em Matemática e Aplicações
O número de pacientes com cancro continua a crescer no mundo e a Organização Mundial da Saúde considerou mesmo esta como uma das principais ameaças para a saúde e o desenvolvimento humano. Dependendo da localização e das especi cidades do tumor, existem muitos tratamentos que podem ser usados, incluindo cirurgia, quimioterapia, imunoterapia e radioterapia. A Radioterapia de Intensidade Modulada (IMRT | Intensity Modulated Radiation Therapy) é uma das modalidades mais avançadas de radioterapia, onde a otimização pode ter um papel importante no que diz respeito à qualidade do tratamento aplicado. Em IMRT, o feixe de radiação pode ser visto como se fosse constituído por vários pequenos feixes, pelo uso de um colimador multifolhas, que permite que a intensidade seja modulada. Este complexo problema de otimização pode ser dividido em três subproblemas, que estão relacionados entre si e que podem ser resolvidos sequencialmente. Para cada paciente, os ângulos de onde a radiação ir a ocorrer têm de ser determinados (problema geométrico | otimização angular). Depois, para cada um desses ângulos, o mapa de intensidades (ou fluências) tem de ser calculado (problema das intensidades | otimização das fluências). Finalmente, e necessário determinar o comportamento do colimador multifolhas, de forma a garantir que as intensidades são, de facto, atribuídas (problema de realiza ção). Em cada um destes problemas de otimização, a qualidade do tratamento atribuído depende dos modelos e algoritmos usados. Neste trabalho, a nossa atenção estará particularmente focada na otimização angular, um problema conhecido por ser altamente não-convexo, com muitos mínimos locais e com uma função objetivo que requer muito tempo de computação para ser calculada. Tal significa, respetivamente, que os algoritmos que sejam baseados no cálculo de gradientes ou que requeiram muitas avaliações da função objetivo podem não ser adequados. Assim, os procedimentos metaheurísticos podem ser uma boa alternativa para abordar este problema, visto que são capazes de escapar de mínimos locais e são conhecidos por conseguirem calcular boas soluções em problemas complexos. Neste trabalho ser a descrita uma aplicação para Pesquisa Tabu. Serão ainda apresentados os testes computacionais realizados, considerando dez casos clínicos de pacientes previamente tratados por radioterapia, pretendendo-se mostrar que a Pesquisa Tabu e capaz de melhorar os resultados obtidos através da solução equidistante, cujo uso e comum na prática clínica.
The number of cancer patients continues to grow worldwide and the World Health Organization has even considered cancer as one of the main threats to human health and development. Depending on the location and speci cities of the tumor, there are many treatments that can be used, including surgery, chemotherapy, immunotherapy and radiation therapy. Intensity Modulated Radiation Therapy (IMRT) is one of the most advanced radiation therapy modalities, and optimization can have a key role in the quality of the treatment delivered. In IMRT, the radiation beam can be thought of as being composed by several small beams, through the use of a multileaf collimator, allowing radiation intensity to be modulated. This complex optimization problem can be divided in three related subproblems that can be solved sequentially. For each patient, the angles from which the radiation will be delivered have to be determined (geometric problem | beam angle optimization). Then, for each of these angles, the radiation intensity map is calculated ( uence or intensity optimization). Finally, it is necessary to determine the behavior of the multileaf collimator that guarantees that the desired radiation intensities are, indeed, delivered (realization problem). In each of these optimization problems, the quality of the treatment delivered depends on the models and algorithms used. In this work the attention will be focused in beam angle optimization, a problem known to be highly non{convex, with many local minima and with an objective function that is time expensive to calculate, which, respectively, means that algorithms that are gradient{based or that require many objective function evaluations will not be adequate. Metaheuristics can be the right tool to tackle this problem, since they are capable of escaping local minima and are known to be able to calculate good solutions for complex problems. In this work, an application of Tabu Search to beam angle optimization is described. Computational results considering ten clinical cases of head{and{neck cancer patients are presented, showing that Tabu Search is capable of improving the equidistant solution usually used in clinical practice.

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Chidambaranathan, Reghupaty Saranya. "TAF2: A potential oncogene for hepatocellular carcinoma." VCU Scholars Compass, 2017. http://scholarscompass.vcu.edu/etd/4924.

Повний текст джерела

Анотація:

Astrocyte Elevated Gene 1 (AEG1) is an oncogene for hepatocellular carcinoma (HCC). Its role in HCC pathogenesis has been well studied. A pan cancer analysis of gene expression in multiple databases identified TATA-box binding protein associated factor 2 (TAF2) as the gene that is most frequently co-expressed with AEG1. TAF2 is a protein that is involved in transcription of genes by RNA polymerase II. It is a factor that is dispensable for basal transcription but, required for activated transcription. It has also been shown to be involved in regulating cyclin levels and hence cell cycle progression. Bioinformatic analysis on data from different cancer databases confirmed the positive correlation of TAF2 expression with AEG1 expression, the over expression of TAF2 in HCC patients and poor survival of HCC patients with increasing TAF2. We confirmed the over expression of TAF2 in HCC cell lines using western blotting and HCC liver using immunohistochemistry. We established cell lines with stable knockdown of TAF2 expression. These clones showed significant decrease in their ability to invade and migrate but not their proliferation ability. This is in contrast to what has been observed in previous studies. We hypothesize that the knockdowns do not show any decrease in cellular proliferation since the remaining TAF2 in the cells is sufficient to produce cyclins and keep cell cycle undisturbed. The knockdown of TAF2 causes an increase in E-cadherin level and decrease in Snail protein expression which is a known negative regulator of E-cadherin. Knockdown of TAF2 causes cells to become more epithelial leading to a decrease in their ability to migrate and invade. This study shows that TAF2 is a potential oncogene that needs to be further studied.

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Stepanenko, Svetlana. "Global Optimization Methods based on Tabu Search." Doctoral thesis, kostenfrei, 2008. http://www.opus-bayern.de/uni-wuerzburg/volltexte/2008/3060/.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Thapa, Dibesh. "Targeting the interaction between p38α and TAB1". Thesis, King's College London (University of London), 2017. https://kclpure.kcl.ac.uk/portal/en/theses/targeting-the-interaction-between-p38-and-tab1(9b1a1609-805a-4698-a673-2a686dabf905).html.

Повний текст джерела

Анотація:

p38α, a member of the mitogen activated protein kinase family, is a stress activated serine/threonine kinase which plays an important role in signalling pathways mediating fundamental processes such as inflammation, apoptosis, autophagy, and cell division, differentiation and death. Over the last two decades, its prominence in ischaemic heart disease has risen rapidly with several studies providing overwhelming evidence that p38α activation aggravates lethal injury during myocardial ischaemia. Several inhibitors have been tested to prevent p38α activation and although they have performed well in the laboratory; unfortunately the results have not translated to clinical trials in patients. This has mainly been due to toxicity such as liver injury, skin rashes, gastrointestinal disorders, and flares-ups of rheumatoid arthritis. These adverse effects are shared by different inhibitors, the majority of which belong to the ATP-mimetic, type I group, suggesting they result from an on-target effect of inhibiting ubiquitously expressed p38α. As a result, an alternative therapeutic strategy, other than the blanket inhibition of p38, is required. TAB1 mediated p38α activation appears to be the culprit behind the detrimental p38α signalling during myocardial ischaemia and selectively targeting this branch of p38α activation, without affecting prototypical p38α activation, is highly desirable. In this thesis I studied the structural features of p38α and TAB1 which contribute to the TAB1-mediated p38α autoactivation mechanism. Using various biochemical and biophysical tools in in-vitro and ex-vivo systems, I have identified the key residue in p38α, and TAB1, which contribute to the auto-activation of p38α by TAB1. The results from my investigations suggest that targeting these residues impairs the autoactivation process and these structural features may be exploited to elucidate p38α’s role in myocardial ischaemia. Ischaemic heart disease continues to be the biggest killer in the world, and the search for p38α inhibitors still continues without any fruitful outcomes. A new direction and strategy focusing on circumstance selective inhibition is required in p38α therapeutics, and hopefully the results in my thesis will contribute to that search.

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Zausa, Cecilia. "SKAM: i teenager norvegesi fra sottotitoli e tabù." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/14688/.

Повний текст джерела

Анотація:

L’obiettivo del presente elaborato è proporre un adattamento di alcuni episodi della serie TV norvegese Skam, incentrata sulla vita di un gruppo di adolescenti di Oslo. Il focus principale della proposta di traduzione sono gli elementi tabù, che spesso vengono eliminati in fase di adattamento e che sono invece fondamentali per un prodotto audiovisivo come questo, lodato a livello mondiale per la sua veridicità e schiettezza. Il primo capitolo dell’elaborato presenta Skam con un inquadramento della sua distribuzione e del coinvolgimento del pubblico, seguito da una breve sinossi delle quattro stagioni di cui la serie TV si compone. Il secondo capitolo si concentra sulle tecniche di adattamento maggiormente utilizzate al giorno d’oggi per i prodotti audiovisivi: il sottotitolaggio e il doppiaggio. Le due tecniche vengono successivamente messe a confronto e viene proposta un’analisi del fansubbing, il fenomeno del sottotitolaggio non professionale ad opera dai fan di una serie TV. La terza parte dell’elaborato apre la questione dei tabù, approfondendo la loro origine e proponendone una classificazione. Il capitolo si occupa anche del fenomeno della censura e della sua diretta applicazione nel caso di Skam, ipotizzando l’effetto che questa potrebbe avere sul prodotto. Il quarto capitolo giustifica la scelta del sottotitolaggio come metodo di adattamento prescelto e illustra le linee guida utilizzate in fase di traduzione. Viene spiegato come il fansubbing sia stato fondamentale per adattare il prodotto e come, alle volte, sia stato necessario ricorrere a motori di traduzione automatica per la combinazione norvegese-inglese. Infine, l’ultimo capitolo propone una serie di esempi pratici di adattamento di elementi tabù, con una breve analisi di ciascun ostacolo incontrato e della scelta traduttiva operata per arrivare a un adattamento il più fedele possibile al prodotto originale.

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Achan, Kannan. "Tabu search in multi-hop optical network design." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0013/MQ52497.pdf.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Lightner, Carin Ann. "A Tabu Search Approach to Multiple Sequence Alignment." NCSU, 2008. http://www.lib.ncsu.edu/theses/available/etd-05312008-191232/.

Повний текст джерела

Анотація:

Sequence alignment methods are used to detect and quantify similarities between different DNA and protein sequences that may have evolved from a common ancestor. Effective sequence alignment methodologies also provide insight into the structure function of a sequence and are the first step in constructing evolutionary trees. In this dissertation, we use a tabu search approach to multiple sequence alignment. A tabu search is a heuristic approach that uses adaptive memory features to align multiple sequences. The adaptive memory feature, a tabu list, helps the search process avoid local optimal solutions and explores the solution space in an efficient manner. We develop two main tabu searches that progressively align sequences. A randomly generated bifurcating tree guides the alignment. The objective is to optimize the alignment score computed using either the sum of pairs or parsimony scoring function. The use of a parsimony scoring function provides insight into the homology between sequences in the alignment. We also explore iterative refinement techniques such as a hidden Markov model and an intensification heuristic to further improve the alignment. This approach to multiple sequence alignment provides improved alignments as compared to several other methods.

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Lin, Yu-Min. "Tabu Search and Genetic Algorithm for Phylogeny Inference." NCSU, 2008. http://www.lib.ncsu.edu/theses/available/etd-10092008-235130/.

Повний текст джерела

Анотація:

Phylogenetics is the study of evolutionary relations between different organisms. Phylogenetic trees are the representations of these relations. Researchers have been working on finding fast and systematic approaches to reconstruct phylogenetic trees from observed data for over 40 years. It has been shown that, given a certain criterion to evaluate each tree, finding the best fitted phylogenetic trees among all possible trees is an NP-hard problem. In this study, we focus on the topology searching techniques for the maximum-parsimony and maximum-likelihood phylogeny inference. We proposed two search methods based on tabu search and genetic algorithms. We first explore the feasibility of using tabu search for finding the maximum-parsimony trees. The performance of the proposed algorithm is evaluated based on its efficiency and accuracy. Then we proposed a hybrid method of the tabu search and genetic algorithm. The experimental results indicate that the hybrid method can provide maximum-parsimony trees with a ggood level of accuracy and efficiency. The hybrid method is also implemented for finding maximum-likelihood trees. The experimental results show that the proposed hybrid method produce better maximum-likelihood trees than the default-setting dnaml program in average on the tested data sets. On a much larger data set, the hybrid method outperforms the default-setting dnaml program and has equally good performance as the dnaml program with the selected jumble option.

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Gedgaudas, Audrius. "Tabu paieškos algoritmas ir programa kvadratinio paskirstymo uždaviniui." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2004. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2004~D_20040527_141211-40277.

Повний текст джерела

Анотація:

Tabu search based algorithms are among the widely used heuristic algorithms for combinatorial optimization problems. In this project, we propose an improved enhanced tabu search algorithm for the well-known combinatorial optimization problem, the quadratic assignment problem (QAP). The new algorithm was tested on a number of instances from the library of the QAP instances  QAPLIB. The results obtained from the experiments show that the proposed algorithm appears to be superior to the earlier "pure" tabu search algorithms on many instances of the QAP.

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Eimontienė, Ieva. "Iteratyvioji tabu paieška ir jos modifikacijos komivojažieriaus uždaviniui." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2007. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2007~D_20070816_142700-63591.

Повний текст джерела

Анотація:

Šiame darbe nagrinėjamas patobulintas tabu paieškos metodas, žinomas kaip iteratyvioji tabu paieška (ITP). Pasiūlytos kai kurios ITP metodo modifikacijos, besiremiančios tam tikromis sprendinių mutavimo (pertvarkymo) procedūromis (inversijos, įterpimai ir kt.), kurios įgalina pagerinti gaunamų sprendinių kokybę. Atlikti išsamūs sudaryto ITP algoritmo ir kitų pasiūlytų modifikacijų eksperimentiniai tyrimai, panaudojant testinius KU pavyzdžius iš KU testinių pavyzdžių bibliotekos TSPLIB. Gauti rezultatai patvirtina pasiūlytų modifikacijų pranašumą kitų ITP variantų atžvilgiu.
In this work, one of the heuristic algorithm – the iterated tabu search and its modifications are discussed. The work is organized as follows. Firstly, some basic definitions and preliminaries are given. Then, the iterated tabu search algoritm and its variants based on special type mutations are considered in more details. The ITS algorithms modifications were tested on the TSP instances from the TSP library TSPLIB. The results of this tests (experiments) are presented as well. The work is completed with the conclusions.

Стилі APA, Harvard, Vancouver, ISO та ін.

28

黃頌詩 and Chung-sze Wong. "Tabu search-based techniques for clustering data sets." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2001. http://hub.hku.hk/bib/B42576556.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Pureza, Vitoria M. M. "Problemas de roteamento de veiculos via metaheuristica tabu." [s.n.], 1990. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259716.

Повний текст джерела

Анотація:

Orientador: Paulo Morelato França
Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica
Made available in DSpace on 2018-07-13T21:48:04Z (GMT). No. of bitstreams: 1 Pureza_VitoriaM.M_M.pdf: 5520851 bytes, checksum: dc03aff16af8a442dbd4125747f19351 (MD5) Previous issue date: 1990
Resumo: O Problema de Roteamento de Veículos (PRV) consiste basicamente em definir rotas eficientes para uma frota de veículos que deve entregar quantidades de bens a um conjunto de clientes. Vários métodos têm sido propostos para tal tarefa, mas devido ao esforço computacional requerido, problemas de maior porte (50 clientes ou mais) são resolvidos por algoritmos aproximados. Dentre estes algoritmos aproximados, abordamos os métodos de melhoria de rotas. Estes métodos são caracterizados pela geração de uma solução inicial factível, seguida da aplicação de mecanismos de busca que alteram a solução inicial. Estes mecanismos promovem essencialmente a melhoria da função objetivo em direção a um mínimo local. Neste ponto, dada a falta de movimentos de melhoria, o algoritmo pára. Apesar do desempenho excelente deste métod6S, observa-se uma limitação fundamental. Sendo o PRV um problema combinatório e, portanto, não convexo, o ótimo local obtido pode não ser o ótimo global. Conseqüentemente, a qualidade da solução final depende drasticamente da solução de partida. Várias técnicas foram elaboradas com vistas à superação da otimalidade local. A maioria delas recomeça o processo de busca a partir de soluções iniciais diferentes ou atrasa a obtenção do ponto ótimo. Outra maneira de lidar com tais limitações é através da aplicação da estratégia de Busca Tabu. Ao invés de evitar ótimos locais, a Busca Tabu os supera, permitindo assim a continuidade das explorações. Neste trabalho apresentamos um estudo da aplicação da técnica de Busca Tabu ao PRV. Um algoritmo dotado de mecanismos de Busca Tabu foi utilizado para a resolução de vinte problemas caracterizados pela existência (ou ausência) de certas restrições temporais. Procedemos a várias análises do comportamento do algoritmo e comparações com outros métodos heurísticos. Os resultados indicaram ser a BuscaTabu uma ferramenta poderosa na resolução de problemas combinatórios
Abstract: Not informed.
Mestrado
Mestre em Engenharia Elétrica

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Wong, Chung-sze. "Tabu search-based techniques for clustering data sets." Click to view the E-thesis via HKUTO, 2001. http://sunzi.lib.hku.hk/hkuto/record/B42576556.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Gunnarsson, Anna-Karin, and Marie Hedendahl. "Sex och samlevnadsundervisning ur lärarperspektiv : Tabu eller självklarhet?" Thesis, Högskolan i Borås, Akademin för bibliotek, information, pedagogik och IT, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-21406.

Повний текст джерела

Анотація:

Sex och samlevnadsundervisning skall liksom all undervisning i skolan baseras på forskning och beprövad erfarenhet. Denna kunskapsöversikt redovisar resultat från ett antal internationella studier om undervisning i sex och samlevnad. Alla studier kommer från den internationella tidskriften Sex Education och behandlar ämnet ur ett lärarperspektiv. Det som lyfts fram och diskuteras är lärares kunskaper, synsätt och attityd till sex och samlevnadsundervisning, vidare diskuteras hur lärare förhåller sig till den diskurs som råder i den befintliga kontexten. Lärares kunskaper kring ämnet påverkar deras attityd och vilja till undervisning. Kompetensutveckling bör ske kontinuerligt då ämnet står under ständig förändring. Andra resultat som belyses är att undervisningen i sex och samlevnad oftast fokuserar på biologiska och hälsorelaterade områden och att frågor rörande bland annat normkritiskt tänkande och lust och njutning får stå tillbaka. Det är inte bara utmaningar och tillgångar på det personliga och mellanmänskliga planet som påverkar undervisningen i sex och samlevnad. Lärare lyfter också fram hur undervisningen påverkas av diskurser på organisations och samhällsnivå. Brist på intresse, politisk styrning, ekonomiska resurser och fortbildning är några av de parametrar som lyfts och som påverkar sex och samlevnadsundervisningen i en eller annan riktning enligt forskningen. Flertalet resultat pekar på att de framgångsfaktorer och utmaningar som finns gällande undervisning i sex och samlevnad i stora drag följer samma mönster som tidigare forskning pekat på. Denna kunskapsöversikt syftar till att sammanställa vetenskapliga studier för att ge en översiktsbild kring forskningen avseende lärares syn på sex och samlevnadsundervisning, vidare syftar översikten till att peka på de utmaningar och framgångsfaktorer som lärare lyfter fram i samband med undervisningen i sex och samlevnad. Metoden som vi valt vid genomförandet av denna kunskapsöversikt bygger i stora drag på Nilholms (2017) metod Systematic Mapping and Analysis of Research Topographies (SMART). SMART är ett systematiskt sätt att söka, kartlägga och analysera det som tidigare forskning har kommit fram till inom ett specifikt område.

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Malleypally, Vinaya. "Parallelizing Tabu Search Based Optimization Algorithm on GPUs." Scholar Commons, 2018. https://scholarcommons.usf.edu/etd/7638.

Повний текст джерела

Анотація:

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.

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Liu, Wen-Hsing. "Tabu search heuristics for the dynamic facility layout problem." Morgantown, W. Va. : [West Virginia University Libraries], 2005. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=3973.

Повний текст джерела

Анотація:

Thesis (M.S.)--West Virginia University, 2005.
Title from document title page. Document formatted into pages; contains vii, 88 p. : ill. Includes abstract. Includes bibliographical references (p. 83-88).

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Kvarnerud, Johan, and Fredrik Molin. "Uthyrning av säljyta : Ett tabu i den svenska bokbranschen?" Thesis, Uppsala University, Department of Business Studies, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-7991.

Повний текст джерела

Анотація:

Under hösten 2006 genomförde Piratförlaget en kampanj för boken ”Edward Finnigans upprättelse” där förlaget hyrde säljplatser i ett 20-tal bokhandlar. Detta var helt nytt i bokbranschen och beskrevs som kontroversiellt av branschtidningen Svensk Bokhandel. Uppsatsens syfte är att undersöka hur uthyrning av säljyta i butik uppfattas av svenska bokhandlare och förlag samt vilka effekter det kan få för sales promotion. Då bokbranschen ser annorlunda ut än övriga dagligvaruhandeln anser vi att det är intressant att sammankoppla uthyrning av säljyta till sales promotion vilket, enligt vår uppfattning, inte används i någon större omfattning i bokhandeln.

Uppsatsens teoretiska bakgrund består i huvudsak av Sudhir & Raos (2006) teori som behandlar fördelar och nackdelar med ”slotting allowances”, vilket är den engelska termen för uthyrning av säljyta. Då teorin baseras på studier från livsmedelsbranschen undersökte vi hur väl den kan tillämpas på bokbranschen. Datainsamling skedde huvudsakligen genom intervjuer med tre förlag och tre bokhandlare. Undersökningens resultat visar att merparten av respondenterna var positivt inställda till att använda uthyrning av säljyta. Vidare kan uthyrning av säljyta leda till en ökad användning av säljställ och skyltningar, även kallat ”POP-promotion”. Slutligen kan uthyrning av säljyta vara ett nytt sätt för förlagen att styra och kontrollera exponeringar i bokhandeln.

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Zekaoui, Latifa. "Mixed covering arrays on graphs and tabu search algorithms." Thesis, University of Ottawa (Canada), 2006. http://hdl.handle.net/10393/27433.

Повний текст джерела

Анотація:

Covering arrays are combinatorial objects that have been successfully applied in the design of test suits for testing software, networks and circuits. Mixed covering arrays on graphs are new generalizations of both mixed covering arrays and covering arrays on graphs. In this thesis, we give new theoretical results and constructions for mixed covering arrays on graphs. First, we extend to the mixed case the work done by Meagher and Stevens [31], which uses graph homomorphisms for covering arrays on graphs. Second, we study covering arrays on special classes of graphs. In particular, we solve to optimality the case in which G is a tree, a cycle or a bipartite graph, as well as give results for wheels and cubic graphs. We also provide general graph operations that preserve the size of a balanced covering array. In the second part of the thesis, we do a complete experimental study of two tabu search algorithms for covering array construction. POT is a variation of the algorithm given by Stardom [40] while PAT is an implementation of the algorithm proposed by Nurmela [35]. We conclude that they provide effective methods for constructing covering arrays of moderate size. In particular, POT and PAT improve upper bounds for 18 sets of parameters for covering arrays.

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Bozkaya, Burcin. "Political districting, a tabu search algorithm and geographical interfaces." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0024/NQ39508.pdf.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Björkegren, Susanne. "Improvisation för klassiska musiker : tabu, onödigt, användbart eller vitalt?" Thesis, Kungl. Musikhögskolan, Institutionen för musik, pedagogik och samhälle, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kmh:diva-1328.

Повний текст джерела

Анотація:

Arbetet handlar om improvisationens förekomst i dagens undervisning på klassiska instrument. I den klassiska musiken har improvisation inte haft någon större roll de senaste 150 åren. Jag ville framförallt få reda på om dagens klassiska instrumentallärare på musik och kulturskolor använder sig av improvisation i sin undervisning och vilka tillvägagångssätt de i så fall har. Men även vad de anser att improvisation är för en klassisk musiker, därav min titel på arbetet. Jag har intervjuat fem lärare som har olika ålder, arbetslivserfarenhet och undervisar på olika instrument. Det visade sig att alla lärarna, i varierande utsträckning, använder sig av improvisation i sin undervisning och anser att improvisation är bra för en klassisk musiker. Jag önskar att mitt arbete kan inspirera klassiska instrumentallärare och musiker till att låta improvisationen ta ett kliv tillbaka in i den klassiska musiken, för jag är övertygad om att den hör hemma där.
This work intends to show improvisations presence in classical instrument teaching. Improvisation has not been an obvious part of classical music in the past 150 years. I wanted to find out if teachers with classical instruments use improvisation with their students and if they do, what course of action they use. But also what they think improvisation is to a classical musician. I have interviewed five teachers with different instruments, ages and professional experience. It turned out that all teachers, to some extent, use improvisation with their students and they consider that it is good for classical musicians to be able to improvise. I hope my work will inspire teachers and musicians to let improvisation return to classical music, because I am convinced that it belongs there.

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Coombes, Neil Edwin. "The reactive tabu search for efficient correlated experimental designs." Thesis, Liverpool John Moores University, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.275932.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Hussin, Naimah Mohd. "Tabu search based hyper-heuristic for examination timetabling problem." Thesis, University of Nottingham, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.423286.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Schachter, Paul J. "TABS - an Asynchronous Block Serial Protocol for Multipoint Applications." International Foundation for Telemetering, 1986. http://hdl.handle.net/10150/615281.

Повний текст джерела

Анотація:

International Telemetering Conference Proceedings / October 13-16, 1986 / Riviera Hotel, Las Vegas, Nevada
Since the early 1960’s, AT&T has established a trend toward centralized and remote operations of the transmission network. Thorough and continuous monitoring of global network properties can only be achieved through centralization. As a result, a secondary network has evolved in support of these monitoring functions. The “telemetry network” comprises a system of distributed processors dedicated to analyses of the transmission network, together with all necessary communication links. Monitoring access to the transmission network is provided at special interface points. Often the interface hardware is integrated into the transmission network element itself. AT&T uses a special protocol, TABS, the Telemetry Asynchronous Block Serial protocol, at the interface between the telemetry network and the transmission network.[1] TABS was designed by AT&T Bell Laboratories to optimize the performance and economics of this interface. In this paper, we describe the structure of that protocol, its performance properties and current implementations.

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Emmrich, Thomas. "Tabu und Meidung im antiken China : Aspekte des Verpönten /." Bad Honnef : Bock und Herchen, 1992. http://catalogue.bnf.fr/ark:/12148/cb36671063t.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Paulauskas, Vitalijus. "Dinaminio draudimų sąrašo taikymas balsavimu grįstuose konkursų vertinimuose." Bachelor's thesis, Lithuanian Academic Libraries Network (LABT), 2011. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2011~D_20110804_092242-49859.

Повний текст джерела

Анотація:

Darbo tikslas - sukurti balsavimu grįstų konkursų vertinimų (pvz. Eurovizijos dainų konkursas, angl. Eurovision Song Contest) internetinę programą, kurioje būtų taikomas dinaminis draudimų sąrašas (tabu list), suteiksiantis galimybę objektyviau vertinti konkurso dalyvius. Su pasirinktais įrankiais buvo sukurta funkcionuojanti internetinė taikomoji programa, skirta Eurovizijos dainų konkursui, kurioje taikomas dinaminis draudimų sąrašas. Darbas yra patalpintas internete šiuo adresu. http://ik.su.lt/~vitpau/.
The aim - to create a voting competition-based assessments (such as the Eurovision Song Contest), an online program, which is a dynamic list of prohibitions (taboo list) which provides an objective assessment of the tenderers. With selected tools were designed for operation of the web application for the Eurovision song contest with a dynamic list of prohibitions. Job are posted online at http://ik.su.lt/~vitpau/.

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Šidla, Donatas. "Ruošinių realizacijos optimizavimo procedūrų sudarymas ir tyrimas." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2004. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2004~D_20040530_221515-42762.

Повний текст джерела

Анотація:

The object of Master Thesis is the creation and research optimization of blank realization procedures. Four main parts comprise the thesis: analysis of the problem, theoretical solutions, research and outcomes, conclusions and recommendations. Optimization methods, their advantages and limitations have been analyzed in the first part. The most appropriate optimization method for problem solving was selected. Designed optimization methods have been presented in the theoretical solutions part: exhaustive search, tabu search and a new one, presented by the author. A program was created for comparison of these methods. In the third part of the thesis outcomes of the research are presented. Designed methods were tested and compared by their routes length, process time, computations duration and other parameters. Conclusions of the thesis and recommendations for implementation of analyzed procedures have been presented in the part of conclusions. Literature in Lithuanian, English was used in preparing the thesis. There are 19 tables and 29 pictures in the thesis.

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Krafft, Manfred. "Kundenbindung und Kundenwert : mit 25 Tab. /." Heidelberg : Physica-Verl, 2002. http://swbplus.bsz-bw.de/bsz095627456cov.htm.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Broglie, Peter Michael. "The role of TAK1 associated binding protein 2 (TAB2) in tumor necrosis factor signaling and cell death." 2010. http://www.lib.ncsu.edu/theses/available/etd-03172010-173343/unrestricted/etd.pdf.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

46

"IL-1シグナル伝達経路におけるアダプター/スカフォールドタンパク質TAB2の作用機構". Thesis, 2005. http://hdl.handle.net/2237/6371.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

47

岸田, 聡., та Satoshi Kishida. "IL-1シグナル伝達経路におけるアダプター/スカフォールドタンパク質TAB2の作用機構". Thesis, 2005. http://hdl.handle.net/2237/6371.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Bergamo, Elisa. "MOLECULAR CHARACTERIZATION OF THE INTERACTIONS BETWEEN HTLV-1 AND HTLV-2 TAX, HBZ AND APH-2 REGULATORY PROTEINS: FUNCTIONAL IMPLICATION FOR NF-ĸB AND IFN-β". Doctoral thesis, 2016. http://hdl.handle.net/11562/939593.

Повний текст джерела

Анотація:

I virus T-linfotrofici umani di tipo 1 e 2 (HTLV-1 e 2) sono retrovirus geneticamente correlati che causano infezioni persistenti in vivo. HTLV-1 è l'agente eziologico della leucemia delle cellule T dell’adulto (ATLL) e della mielopatia / paraparesi spastica tropicale, mentre HTLV-2 non è associato a disturbi simili ad ATLL. L’interesse principale della ricerca è stato rivolto allo studio delle proteine espresse da HTLV, Tax e HBZ e APH-2, allo scopo di comprendere il meccanismo di deregolazione dell’espressione genica indotta dal virus. Tax svolge un ruolo fondamentale nella deregolazione dei pathways cellulari coinvolti nella risposta immunitaria, nell'infiammazione, nella sopravvivenza delle cellule e nello sviluppo del cancro, mentre HBZ gioca un ruolo cruciale nella proliferazione delle cellule T. Il confronto tra le proprietà molecolari e le funzioni delle proteine Tax e HBZ di HTLV-1 con le proteine Tax e APH-2 dell’omologo HTLV-2, può portare alla identificazione dei passaggi chiave nello sviluppo della leucemia. Lo studio condotto durante il dottorato è stato incentrato sull’interazione delle proteine regolatrici di HTLV con i fattori dell'ospite. Sono stati indagati due aspetti: a) l'interazione di Tax-1 e Tax-2 con chinasi IKK-correlate, che interagiscono tra diverse vie di segnalazione coinvolte nella proliferazione e nella sopravvivenza delle cellule tumorali; b) l'interazione di HBZ e APH-2 con i fattori cellulari che partecipano al pathway di NF-ĸB. I dati ottenuti in questo studio hanno dimostrato una nuova interazione delle proteine Tax-1 e Tax-2 con le chinasi IKKε e TBK1, coinvolte nella via dell’interferone. I risultati hanno dimostrato che le proteine Tax sono reclutate in complessi che contengono IKKε e TBK1 alterando l’attivazione del promotore dell’IFN-β. Questi risultati evidenziano un ruolo chiave di TBK1/IKKε nella regolazione della risposta dell’interferone β in presenza dell'espressione di proteine virali. Successivamente, sono stati eseguiti studi per chiarire il ruolo di APH-2 nell’interazione con i fattori cellulari del pathway di NF-ĸB rispetto al suo omologo HBZ. I risultati dimostrano che APH-2, come HBZ, interagisce con p65 e inibisce l'attivazione di NF-ĸB. Per la prima volta è stato dimostrato che APH-2 è in grado di inibire l’attivazione di NF-ĸB mediata dalle proteine Tax e differisce da HBZ nel meccanismo di questa inibizione. APH-2 interagisce con le proteine Tax, e, quando co-espressa con Tax, cambia la sua distribuzione cellulare. I dati dimostrano che APH-2 è presente nelle strutture citoplasmatiche di Tax-2 assieme ai fattori TAB2 e TRAF3 ed interagisce con TRAF3. Questi risultati supportano l’ipotesi che APH-2, diversamente da HBZ, possa essere trattenuta nei complessi citoplasmatici, limitando il suo effetto inibitorio nell’attivazione dei promotori NF-ĸB. Nel loro insieme questi studi comparativi sulle proteine regolatrici virali possono contribuire a comprendere meglio la differente patogenicità di HTLV-1 e HTLV-2.
Human T-cell leukemia virus types 1 and 2 (HTLV-1 and 2) are genetically related retroviruses that cause persistent infections in vivo. HTLV-1 is the causative agent of adult T-cell leukemia (ATLL) and myelopathy/tropical spastic paraparesis, while HTLV-2 is not associated with ATLL-like disorders. Two viral proteins expressed by the HTLV-1, Tax and HBZ, are the major focus of current research that aims to understand the oncogenic mechanism of ATLL. Tax plays a pivotal role in the deregulation of cellular pathways involved in the immune response, inflammation, cell survival and cancer, whereas HBZ plays a crucial role in T cell proliferation. Comparison of HTLV-1 Tax and HBZ molecular properties and functions to the homologous HTLV-2 Tax and APH-2 proteins should provide insight into better understand the keys steps in leukemogenesis. The Ph.D. study has been focused on HTLV regulatory proteins interaction with host factors, investigating two aspects: a) Tax-1 and Tax-2 interaction with the IKK-related kinases; b) HBZ and APH-2 interaction with host factors involved in NF-ĸB pathway. The results obtained in these studies showed a novel interaction of Tax-1 and Tax-2 proteins with IKKε and TBK1 kinases. The data demonstrated that Tax proteins may be recruited in complexes that contain IKKε and TBK1, altering IFN-β promoter activation. These results highlight a key role of TBK1/IKKε in the regulation of the interferon-β response in the presence of viral protein expression. Additional analyses were performed to investigate the role of APH-2 interaction with host factors involved on NF-ĸB pathway in comparison with its homolog HBZ. The results showed that APH-2, like HBZ, interacts with p65 and inhibits NF-ĸB. I have demonstrated for the first time that APH-2 is able to inhibit Tax proteins-mediated NF-ĸB activation and that APH-2 differs from HBZ in the mechanism of inhibition. APH-2 is able to interact with Tax proteins, and when co-expressed with Tax-2, they re-localized in the cells. Moreover, the data showed that APH-2 was present in Tax-2 cytoplasmic structures containing TAB2 and TRAF3 and that APH-2 interacted with TRAF3. The recruitment of APH-2 in cytoplasmic complexes containing Tax-2 may explain the differences in inhibition of NF-ĸB pathway compared to HBZ.

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Junková, Anna. "Tabu a noa v komunikaci. Realizace jazykových tabu v tištěných médiích." Master's thesis, 2011. http://www.nusl.cz/ntk/nusl-300150.

Повний текст джерела

Анотація:

Taboo and noa in communication. Realization of linguistic taboos in the print media. This thesis deals with issues of the taboo and noa in language and communication. The core of this thesis is to identify the essential tabooed themes in contemporary society and ways of their linguistic realization in the print media. In the theoretical part of this thesis is the first explained substance of the terms such as taboo, noa, communication and linguistic taboos with regard to the interrelations between these terms. In the empirical part are then defined tabooed themes occurring in the concrete texts of the diary Mladá fronta DNES and Blesk and of the periodical Rytmus života and ways of their linguistic grasping. The thesis focuses above all on the manifestations of speech restrictions in the lexical plan of the language.

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Lin, Juei Yang, and 林睿暘. "Enhanced Parallel Tabu Search." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/34616811717440382778.

Повний текст джерела

Анотація:

碩士
國立清華大學
工業工程與工程管理學系
89
Tabu search is a widely used heuristic search method. One of the main components of tabu search is tabu list, which makes several latest moves forbidden in order to escape from a small loop. The algorithm starts from an initial solution, and moves the current solution to the best neighborhood which is not forbidden. These iterations will be repeated until the terminating condition is reached. There are two main drawbacks in the traditional tabu search. First, tabu search only provides an approximate solution. There is no way to know the quality of the obtained solutions. Second, although tabu list helps the search avoiding a small cycling problem, it cannot prevent a previously searched area to be searched again or forming a large cycle. The computation efficiency of a tabu search can be improved by implementing a parallel tabu search, which uses multiple processors to search in parallel. In the study, we propose an enhanced parallel tabu search, which attempts to compute more efficiently and conquer the two drawbacks mentioned above. The ratio of finding the old local optimum solutions may suggest the confidence level of the best solution we find at the end of search. Also, the historical memory of local optimum solutions helps us to avoid searching old areas again. To validate the efficiency of the new approach, we will use a series of number sequencing problems. In addition, we apply statistical method to test the suggested relationship between the ratio of old local optimum and the confidence level of the obtained solution. The result of experiments shows that it takes less time for the enhanced parallel tabu search to find global optimum solutions than conventional one. The ratio of finding the old local optimums does not precisely estimates the confidence level of the best solution. However, our results show that the probability of finding the global optimal solutions should be larger than the computed ratio. 1.1研究背景 1 1.2研究動機 1 1.3研究架構 3 第2章文獻回顧 4 2.1塔布搜尋法 4 2.2平行塔布搜尋法 9 2.3塔布搜尋效率的改善方法 11 第3章方法構建 13 3.1改進之平行塔布搜尋法 13 3.1.1子空間的定義 13 3.1.2隨機起始解 14 3.1.3長期記憶結構 15 3.1.4落入涵蓋區域的比率 16 3.2改進之平行處理演算法 19 3.3改進之平行塔布搜尋法的優點 23 第4章實驗設計與分析 24 4.1問題描述 24 4.1.1多個處理器的模擬方法 24 4.1.2數字排序問題 25 4.2 求解數字排序問題的改進之平行塔布搜尋法的設定 26 4.3 離開舊區域最佳解後脫離方向的比較 27 4.4涵蓋比率的實驗設計 29 4.4.1落入涵蓋區域的比率的實驗 29 4.4.2驗證子空間是否為均勻的分佈 32 4.5比較搜尋速度的實驗結果與分析 35 第5章結論與未來展望 38 參考文獻 39

Стилі APA, Harvard, Vancouver, ISO та ін.

Дисертації з теми "TAB2"

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями