Dissertations / Theses on the topic 'Colony'
To see the other types of publications on this topic, follow the link: Colony.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Colony.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Sampattavanich, Somponnat. "System to study colony-colony interactions in embryonic stem cells." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/40880.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.Includes bibliographical references (p. 101-108).
Many efforts have been made to characterize the necessary regulatory factors involved in self-renewal of embryonic stem cells (ESCs). Recent studies suggested that different autocrine factors exist in murine ESCs (mESCs) and can influence their self-renewal and proliferation, predominantly in deficiency conditions. These observations were investigated based on a comparison of different groups of mESCs that were plated at varying cell densities. In this study, we developed an experimental platform to study colony-colony interactions in mESCs. We have used stencil cell patterning to precisely localize mESC colonies on the culture substrate. This technique allows the formation of mESC colonies with precise shape and controllable inter-colony distances. We monitored colony proliferation, motility and fusion in response to different initial colony configurations over time using the developed image analysis algorithms and immunohistochemistry techniques. Different cultivating conditions commonly used for mESCs were tested to identify the environment where autocrine signaling is significant.
by Somponnat Sampattavanich.
S.M.
2
Feng, Yinda. "Ant colony for TSP." Thesis, Högskolan Dalarna, Datateknik, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4824.
Full textAbstract:
The aim of this work is to investigate Ant Colony Algorithm for the traveling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. This paper is based on the ideas of ant colony algorithm and analysis the main parameters of the ant colony algorithm. Experimental results for solving TSP problems with ant colony algorithm show great effectiveness.
3
Angus, Daniel John. "Niching ant colony optimisation." Swinburne Research Bank, 2008. http://hdl.handle.net/1959.3/36804.
Full textAbstract:
Thesis (Ph.D) - Swinburne University of Technology, Faculty of Information & Communication Technologies, Complex Intelligent Systems Laboratory, 2008.Submitted in partial fulfilment for the degree of Doctor of Philosophy, Complex Intelligent Systems Laboratory, Faculty of Information and Communication Technologies, Swinburne University of Technology, 2008. Typescript. Includes bibliographical references (p. 169.181).
4
Too, Wing-tak Ken, and 杜永德. "Artist colony at Green Island." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1997. http://hub.hku.hk/bib/B31983650.
Full text
5
Cilliers, Jeanne. "Cape Colony marriage in perspective." Thesis, Stellenbosch : Stellenbosch University, 2013. http://hdl.handle.net/10019.1/79863.
Full textAbstract:
Thesis (MComm)--Stellenbosch University, 2013.ENGLISH ABSTRACT: Despite the importance of studying marriage patterns for a better understanding of colonial life, the subject has received little attention from a purely economic perspective. In his seminal work, European Marriage Patterns in Perspective (1965), J. Hajnal introduces the notion of a European Marriage Pattern (EMP) emerging in the late Middle Ages which became characteristic of Western European society in the early modern period. Hajnal points out several distinct aspects to distinguish Western European marriages from all other societies of the time. While existing literature in this field has typically focussed on the demographic features of marriage patterns, such as the average age of marriage, the share of the population that had never married, and the effects of the EMP on fertility and resulting population growth, little attention has been paid to the underlying mechanisms and causes of the EMP. Using genealogical records to track the ancestry of colonial settlers in South Africa, this study will investigate the evolution of marriage in the Cape Colony. The focus is primarily on the persistence of the EMP and attempt to determine whether it continued to characterise the marriages of European descendents outside of Europe, or whether a distinct marriage pattern emerged in the Cape Colony in the eighteenth and early nineteenth century. It will explore the effect that such patterns may have historically had on family size, standards of living and life chances for European settlers at the Cape, with an aim to shed new light on the underlying causes of the EMP, by critically evaluating De Moor and van Zanden’s (2010) three hypotheses of the origins of this distinct marriage pattern.
AFRIKAANSE OPSOMMING: Ten spyte van die bydrae wat ’n studie van huwelikspatrone tot ’n beter begrip van die ekonomiese ontwikkeling en sosiale konteks tydens die koloniale era kan maak, ontvang hierdie onderwerp min aandag vanuit 'n suiwer ekonomiese perspektief. In John Hajnal se bekende publikasie, European Marriage Patterns in Perspective (1965), stel hy die konsep van 'n Europese Huweliks Patroon (EHP) voor. Hierdie patroon het waarskynlik in die laat-Middeleeue verskyn en die Wes-Europese samelewing in die vroeë-moderne tydperk gekenmerk. Hajnal beskryf sekere unieke aspekte wat Wes-Europese huwelike van alle ander samelewings van hierdie tydperk onderskei. Bestaande literatuur oor hierdie onderwerp fokus tipies op die demografiese kenmerke van huwelikspatrone, soos die gemiddelde ouderdom waarop individue trou, die gedeelte van die bevolking wat nooit trou nie en die gevolge wat die EHP op fertiliteit en bevolkingsgroei het. Min aandag is dus aan die onderliggende oorsake van die EHP gegee. Deur gebruik te maak van die Suid-Afrikaanse Geslagregisters is dit moontlik om die herkoms van koloniale setlaars in Suid-Afrika na te spoor. Hierdie studie fokus dus op die ontwikkeling van ’n huwelikspatroon in die Kaapkolonie. Die vraag is of die EHP die huwelike van Europese afstammelinge buite Europa steeds gekenmerk het en of daar ’n ander huwelikspatroon in die agtiende en vroeë-negentiende eeu in die Kaapkolonie na vore gekom het. Die vraag word beantwoord deur ’n kritiese analise van De Moor en van Zanden (2010) se drie hipoteses oor die oorsprong van hierdie eiesoortige huwelikspatroon.
6
Too, Wing-tak Ken. "Artist colony at Green Island." Hong Kong : University of Hong Kong, 1997. http://sunzi.lib.hku.hk/hkuto/record.jsp?B25954611.
Full text
7
Laptik, Raimond. "Ant colony technologies for image processing." Doctoral thesis, Lithuanian Academic Libraries Network (LABT), 2010. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20100303_133726-51617.
Full textAbstract:
In this work ant colony technologies for image processing are analyzed. Modifications of Max-Min ant system for automatic image pre-processing are proposed. Image segmentation by multiple ant colonies technique based on pheromone competition is proposed. Modified ant system is implemented in FPGA and MicroBlaze core units influence on performance is analyzed.Darbe nagrinėjamos skruzdžių kolonijų technologijos vaizdams apdoroti. Pasiūlomos max-min skruzdžių sistemos modifikacijos tinkamos automatizuoti pirminį vaizdų apdorojimą. Pristatoma vaizdų segmentavimo metodika grįsta skruzdžių kolonijų varžymusi feromono pagalba. Nagrinėjama, įgyvendintos LPLM įrenginyje, modifikuotos skruzdžių sistemos sparta ir MicroBlaze modulių įtaka spartai.
8
Matějka, Lukáš. "Obslužný program pro colony-picking robot." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2012. http://www.nusl.cz/ntk/nusl-219703.
Full textAbstract:
From an overview of most commonly used kinematic conceptions of robotic manipulators, the conception of Cartesian robot was identified as the most suitable for the given task of colony picking. A control system consisting of two modular parts has been designed for the colony picking robot. ColonyCounter module is a set of image processing libraries for identification of microbial colonies in image data and precise localization of individual colonies. This has been achieved by combination of multiple methods, most importantly connected components labelling and Hough circular transform. The second module – ColonyPicker – utilizes output of ColonyCounter module to plan the picking and placing of colonies. Subsequently it controls the transfer process itself using an innovative task planning and executing system.
9
Skocki, Tomasz. "Memoria delle colonie e postcolonialismo nella letteratura italiana contemporanea." Thesis, Paris 10, 2014. http://www.theses.fr/2014PA100056/document.
Full text
10
Modlmeier, Andreas [Verfasser]. "The influence of individual and colony level variation in behavior on colony performance in ants / Andreas Modlmeier." Mainz : Universitätsbibliothek Mainz, 2012. http://d-nb.info/1029394334/34.
Full text
11
Krajewski, Andrew Stephen. "Human T-lymphocyte colony formation in vitro." Thesis, University of Edinburgh, 1985. http://hdl.handle.net/1842/24047.
Full text
12
Gambardella, Luca Maria. "Coupling ant colony system with local search." Doctoral thesis, Universite Libre de Bruxelles, 2015. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209045.
Full textAbstract:
In the last decades there has been a lot of interest in computational models and metaheuristics algorithms capable to solve combinatorial optimization problems. The recent trend is to define these algorithms taking inspiration by the observation of natural systems. In this thesis the Ant Colony System (ACS) is presented which has been inspired by the observation of real ant colonies. ACS is initially proposed to solve the symmetric and asymmetric travelling salesman problems where it is shown to be competitive with other metaheuristics. Although this is an interesting and promising result, it was immediately clear that ACS, as well as other metaheuristics, in many cases cannot compete with specialized local search methods. An interesting trend is therefore to couple metaheuristics with a local optimizer, giving birth to so-called hybrid methods. Along this line, the thesis investigates MACS-VRPTW (Multiple ACS for the Vehicle Routing Problem with Time Windows) and HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem (SOP). In the second part the thesis introduces some modifications of the original ACS algorithm. These modifications are able to speed up the method and to make it more competitive in case of large problem instances. The resulting framework, called Enhanced Ant Colony System is tested for the SOP. Finally the thesis presents the application of ACS to solve real-life vehicle routing problems where additional constraints and stochastic information are included.Doctorat en Sciences de l'ingénieur
info:eu-repo/semantics/nonPublished
13
Newton, Laura. "The Cullercoats artists' colony c. 1870-1914." Thesis, Northumbria University, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.343880.
Full textAbstract:
This thesis analyses the work of the artists living and painting in the area around the fishing village of Cullercoats and examines the conditions which fostered and maintained this colony during the period 1870 to 1914. As part of this process, two hitherto disparate bodies of scholarship are considered in tandem. Firstly, the increasing number of studies into European artists' colonies, encompassing consideration of both the phenomenon itself and of the artworks produced at them. Secondly, the locally-based recovery of late-Ivth-cenrury north east artists and their milieu, which has grown out of regional exhibition projects. Exposing the very clear areas of commonality between the two spheres of study underscores the central questions which this thesis addresses; namely, can the group of artists at Cullercoats be described as a colony; and if so, why has it been so consistently denied a place in colony surveys to-date? Answers are sought by engaging with a number of inter-related issues. These include the particular economic and social conditions which could sustain a local artists' colony and the variety of art clubs, exhibition spaces and sales venues which the colony fostered: the specific elements which are necessarily present to mark out a 'colony', rather than merely a 'sketching ground': the wider contemporary awareness of the colony and its work and how this compares with similar coastal colonies in Britain: the unpicking of the ideologies which underpinned the Naturalist subject in British art in the late-LOth century, including issues of race and gender ideals, nationalism and regionalism, tourism, and anxieties over urbanisation and industrialisation. The scope of this thesis demands an inter-disciplinary approach, combining social, economic and political history, gender studies, the wider field of 'cultural studies', as well as the usual analytical tools of the art historian. In essence, the thesis combines an empirical and theoretical contextualisation as the framework for a fresh perspective on the position and work of the Cullercoats artists' colony, which has wider implications for our understanding of European Naturalism and the colony phenomenon.
14
Somerville, Linda Elizabeth. "Granulocyte colony-stimulating factor : structure-function studies." Thesis, Queen's University Belfast, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.287428.
Full text
15
Krenzke, Tom (Tom Paul). "Ant colony optimization for agile motion planning." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/35292.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2006.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 67-69).
With the need for greater autonomy in unmanned vehicles growing, design of algorithms for mission-level planning becomes essential. The general field of motion planning for unmanned vehicles falls into this category. Of particular interest is the case of operating in hostile environments with unknown threat locations. When a threat appears, a replan must be quickly formulated and executed. The use of terrain masking to hide from the threat is a vital tactic, which a good algorithm should exploit. In addition, the algorithm should be able to accommodate large search spaces and non-linear objective functions. This thesis investigates the suitability of the Ant Colony Optimization (ACO) heuristic for the agile vehicle motion planning problem. An ACO implementation tailored to the motion planning problem was designed and tested against an existing genetic algorithm solution method for validation. Results show that ACO is indeed a viable option for real-time trajectory generation. ACO' ability to incorporate heuristic information, and its method of solution construction, make it better suited to motion planning problems than existing methods.
by Tom Krenzke.
S.M.
16
Connell, Jonathan H. "A colony architecture for an artificial creature." Thesis, Massachusetts Institute of Technology, 1989. http://hdl.handle.net/1721.1/111562.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1989.Includes bibliographical references (leaves 168-172).
by Jonathan Hudson Connell.
Ph.D.
17
Pettersson, Lars, and Johansson Christoffer Lundell. "Ant Colony Optimization - Optimal Number of Ants." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229764.
Full textAbstract:
The focus of this thesis paper is to study the impact the number of ants has on the found solution of the Ant Colony Optimization (ACO) metaheuristic when solving the Traveling Salesman Problem. The goal was to find out how the length of the computed tours change for different amounts of ants within a limited number of iterations. To study this, three well known versions of the ACO algorithm were implemented and tested: Min-Max Ant System (MMAS), Elitist Ant System (EliteAS) and Ranked Ant System (RankedAS). The results showed trends that were consistent over several test cases. EliteAS and RankedAS which both utilize specialist ants showed clear signs that the number of specialists had a large influence on the length of solutions. Meanwhile, normal ants did not affect the solutions as much. MMAS and EliteAS only had a small variation on the answer, with lower amount of ants being more favorable. On the other hand, RankedAS performed better by a large margin when working with five specialists and a number of ants equaling the number of cities in the problem.Målet med denna rapport var att studera hur antalet myror som används av Ant Colony Optimization (ACO) påverkar resultatet vid lö- sandet av Traveling Salesman Problem (TSP). Hur ändras lösningens längd med olika antal myror, när antalet iterationer som får användas är begränsat? För att få fram ett svar på frågan implementerades och testades tre välkända ACO algoritmer: Min-Max Ant System (MMAS), Elitist Ant System (EliteAS) och Ranked Ant System (RankedAS). Efter implementering och utförlig testning så uppdagades trender som var konsistenta över flera testfall. För EliteAS och RankedAS, som bå- da förlitar sig på specialiserade myror, hade antalet specialister en stor påverkan på den funna längden. Normala myror hade istället en liten påverkan på slutresultatet. För MMAS och EliteAS så var skillnaden minimal, med en viss favör mot ett lägre antal myror. RankedAS hade en motsatt trend och hade bäst resultat med fem specialister och lika många normala myror som antalet städer i TSP instansen.
18
Muller, Lavonne Elorie. "Racism and Abjection in the (Post) Colony." Diss., University of Pretoria, 2020. http://hdl.handle.net/2263/77484.
Full textAbstract:
This study examines Kristeva’s notion of abjection to understand the workings of colonial racism. Given the limitations of her Eurocentric standpoint, reference will also be made to the critiques and engagements with abjection by various other scholars. Abjection, when appropriately rethought, could prove to be a beneficial tool to diagnose the interior problems of racism within the historical context of settler-colonialism and apartheid with specific focus on racism within the contemporary South African context.
Reference will also be made to the film, Get Out, to illustrate the persistence of the historically informed system of abject racism and to place emphasize the deficiencies of narrow interpretations of racism which overlook the broader domain of the psycho-social and institutionalised practices of racial abjection. I will elaborate on the proposed critical investigation by drawing parallels between film, specifically the 2017 horror film Get Out, and legislation, Prevention and Combating of Hate Crimes and Hate Speech Bill. In this sense, Get Out, will be considered as a narrative which questions South Africa’s contemporaneity as a (post)colonial and (post)apartheid state and the limits of the law by comparing and contrasting the film to, the recently approved, Prevention and combating of Hate Crimes and Hate Speech Bill. I intend to argue that the Prevention and Combating of Hate Crimes and Hate Speech Bill operates on a narrow level and that it is incapable of responding to structural racism as it fails to recognise the psycho-social dimension of racism and that abject racism continues into the (post)colonial context.Dissertation (LLM)--University of Pretoria, 2020.
Jurisprudence
LLM
Unrestricted
19
Oliveira, Márcio Adriano Guiomar de. "Sea bass macrophage colony stimulating factor receptors." Master's thesis, Universidade de Aveiro, 2010. http://hdl.handle.net/10773/8803.
Full textAbstract:
Mestrado em Biologia Molecular e CelularO receptor do factor estimulante de colónias de macrófagos, também conhecido como receptor do factor estimulante de colónias-1 (CSF1R), é um receptor de um factor de crescimento hematopoiético que é especificamente expresso em células do sistema fagocítico-mononuclear e desempenha um papel essencial no desenvolvimento e regulação destas células. O CSF1R já foi descrito em vários mamíferos e a sua biologia tem sido exaustivamente caracterizada nestes vertebrados mas o conhecimento sobre esta molécula em peixes é ainda muito reduzido. Neste trabalho é descrita a sequenciação e caracterização de duas formas do CSF1R de robalo (Dicentrarchus labrax L.). Foram isolados dois cDNAs diferentes que codificam proteínas homólogas ao CSF1R de outros vertebrados. Um cDNA de 4535 bp, com uma open reading frame (ORF) de 2946 bp que codifica uma proteína de 981 aminoácidos homóloga a proteínas CSF1R1/CSF1Ra já descritas em peixes e um cDNA de 3229 bp, com uma ORF de 2817 bp que codifica uma proteína de 938 aminoácidos homóloga a proteínas CSF1R2/CSF1Rb já descritas em peixes. Ambas as proteínas caracterizadas conservam domínios e aminoácidos chave que são funcional e estruturalmente importantes nos CSF1Rs de mamíferos. A identificação destes receptores irá permitir uma melhor compreensão da biologia das células do sistema fagocítico-mononuclear do robalo. Nomeadamente, poderão ser usados como marcadores específicos deste tipo de células e permitir estudos mais detalhados sobre a immunologia do robalo e dos teleósteos em geral.
The macrophage colony stimulating factor receptor, also known as colony stimulating factor-1 receptor (CSF1R), is a hematopoietic growth factor receptor that is specific of the cells of the mononuclear phagocytic lineage and has a key role in its development and regulation. Several mammalian CSF1R proteins have been described and its biology has been extensively characterized but in fish, knowledge about this receptor is still scarce. We have sequenced and characterized the sea bass (Dicentrarchus labrax L.) CSF1R molecules. Two different cDNAs coding for proteins homologous to vertebrate CSF1R proteins were isolated. A 4535 bp cDNA, with a 2946 bp open reading frame (ORF) that codes for a 981 amino acid protein, homologous to known bony fish CSF1R1/CSF1Ra proteins and a 3229 bp cDNA, with a 2817 bp ORF that codes for a 938 amino acid protein, homologous to known bony fish CSF1R2/CSF1Rb molecule. Both receptors display a high degree of conservation of domains and key amino acids known to be important functional and structural features of the mammalian counterparts. The identification of these receptors will allow for a better understanding of the biology of sea bass mononuclear phagocytic cells. They can be used as specific markers of sea bass monocytes and macrophages and enable more detailed studies on sea bass immunity.
20
Ku, Chun-Ying. "Regulation of Colony-Stimulating Factor-1 Biosynthesis." Thesis, University of North Texas, 1990. https://digital.library.unt.edu/ark:/67531/metadc332103/.
Full textAbstract:
Recent studies suggest that synthesis of the Colony-stimulating factor (CSF) is a well regulated process. However, the molecular mechanisms of the signal transduction of the various inducers of CSF such as monokines and lymphokines are not well understood. Using Interleukin 1 (IL-1) stimulation of CSF-1 in the MIA PaCa-2 cell line as a model system, the involvement of G-protein has been studied. The IL-1 induction of CSF-1 synthesis can be inhibited by both Pertussis toxin and Cholera toxin, which are known to modify the Gᵢ and Gₛ proteins respectively, thus activating adenylate cyclase to release more cAMP. The toxin inactivation can be prevented by inhibitors of the ADP-ribosylation such as, benzamide and MBAMG. Addition of dibutyryl-cAMP inhibits the IL-1 induced CSF production. Both Theophylline and Forskolin which increase cAMP by inhibiting phosphodiesterase and stimulating adenylate cyclase respectively, also inhibit CSF-1 production. Results from these studies have shown that cAMP level inversely regulates the biosynthesis of CSF-1. Preincubation of MIA PaCa-2 cells with IL-1 and 5'- guanylylimidodiphosphate (GppNHp) prevents the inhibitory effect of pertussis toxin on CSF-1 production. These data are consistent with the hypothesis that IL-1 binds to its receptor and couples to Gᵢ∝ resulting in the inhibition of adenylate cyclase and reducing cAMP level. Lowering of the' cAMP level leads to the activation of CSF-1 gene expression. The activity of another inducer of CSF-1 production in this system, 12-0-tetradecanoylphorbol-13-acetate (TPA), can be abolished by 1- (5-isoquinolinesulfonyl)-2-methylpiperazine dihydrochloride (H-7), which is a specific inhibitor of protein kinase C. However, H-7 failed to inhibit IL-1 stimulated CSF-1 production. Other known activators of protein kinase C namely, Ca²⁺ and L-α-l-oleoyl-2-acetoyl-sn- 3-glycerol (OAG), also increase CSF production. On the other hand, Indomethacin which is known to inhibit prostaglandin E (PGE), stimulates CSF-1 production in MIA PaCa-2 cells. These data suggest that different mechanisms for stimulation of CSF-1 synthesis exist in MIA PaCa-2 cells depending on the inducer. The IL-1 stimulated pathway which does not require PKC activity and appears to be associated with adenylyl cyclase regulation whereas phorbol ester induced pathway involves protein kinase C in the signaling process as expected.
21
Renfrew, David T. "TRAFFIC SIGNAL CONTROL WITH ANT COLONY OPTIMIZATION." DigitalCommons@CalPoly, 2009. https://digitalcommons.calpoly.edu/theses/190.
Full textAbstract:
Traffic signal control is an effective way to improve the efficiency of traffic networks and reduce users’ delays. Ant Colony Optimization (ACO) is a metaheuristic based on the behavior of ant colonies searching for food. ACO has successfully been used to solve many NP-hard combinatorial optimization problems and its stochastic and decentralized nature fits well with traffic flow networks. This thesis investigates the application of ACO to minimize user delay at traffic intersections. Computer simulation results show that this new approach outperforms conventional fully actuated control under the condition of high traffic demand.
22
CHEN, Yijun. "Ant colony optimization approach for stacking configurations." Digital Commons @ Lingnan University, 2011. https://commons.ln.edu.hk/cds_etd/2.
Full textAbstract:
In data mining, classifiers are generated to predict the class labels of the instances. An ensemble is a decision making system which applies certain strategies to combine the predictions of different classifiers and generate a collective decision. Previous research has empirically and theoretically demonstrated that an ensemble classifier can be more accurate and stable than its component classifiers in most cases. Stacking is a well-known ensemble which adopts a two-level structure: the base-level classifiers to generate predictions and the meta-level classifier to make collective decisions. A consequential problem is: what learning algorithms should be used to generate the base-level and meta-level classifier in the Stacking configuration? It is not easy to find a suitable configuration for a specific dataset. In some early works, the selection of a meta classifier and its training data are the major concern. Recently, researchers have tried to apply metaheuristic methods to optimize the configuration of the base classifiers and the meta classifier.
Ant Colony Optimization (ACO), which is inspired by the foraging behaviors of real ant colonies, is one of the most popular approaches among the metaheuristics. In this work, we propose a novel ACO-Stacking approach that uses ACO to tackle the Stacking configuration problem. This work is the first to apply ACO to the Stacking configuration problem. Different implementations of the ACO-Stacking approach are developed. The first version identifies the appropriate learning algorithms in generating the base-level classifiers while using a specific algorithm to create the meta-level classifier. The second version simultaneously finds the suitable learning algorithms to create the base-level classifiers and the meta-level classifier. Moreover, we study how different kinds on local information of classifiers will affect the classification results. Several pieces of local information collected from the initial phase of ACO-Stacking are considered, such as the precision, f-measure of each classifier and correlative differences of paired classifiers. A series of experiments are performed to compare the ACO-Stacking approach with other ensembles on a number of datasets of different domains and sizes. The experiments show that the new approach can achieve promising results and gain advantages over other ensembles. The correlative differences of the classifiers could be the best local information in this approach.
Under the agile ACO-Stacking framework, an application to deal with a direct marketing problem is explored. A real world database from a US-based catalog company, containing more than 100,000 customer marketing records, is used in the experiments. The results indicate that our approach can gain more cumulative response lifts and cumulative profit lifts in the top deciles. In conclusion, it is competitive with some well-known conventional and ensemble data mining methods.
23
Normando, Cruz Enrique. "Mujeres en la Colonia. Dominación colonial, diferencias étnicas y de género en cofradías y fiestas religiosas en Jujuy, Río de la Plata." Pontificia Universidad Católica del Perú, 2012. http://repositorio.pucp.edu.pe/index/handle/123456789/80380.
Full textAbstract:
El artículo analiza comparativamente la participación de las mujeres en las cofradías y las fiestas religiosas. Revela que a fines del periodo colonial, las mujeres indígenas del mundo rural son distintas a las mujeres españolas de la élite y a las mujeres mestizas e indias del casco urbano, pues existe entre ellas una «distancia entre sí», establecida no solo por las diferencias económicas y culturales (Bourdieu 200: 116), sino también por las diferencias étnicas. Las voces de las campesinas indígenas de Purmamarca, Tumbaya o Cholacor se regodean en libertad, y a veces alcoholizadas, en los espacios públicos del trabajo junto a los hombres, y cantan con autoridad periódica en la cotidianeidad de las fiestas religiosas. En cambio, las campesinas del ejido y las chicheras indígenas que trabajan en la plaza de San Salvador de Jujuy solo pueden alzar su letanía en los coros de las cofradías religiosas, en la vida familiar o en el trabajo en espacios públicos, lugares también habilitados y controlados por el hombre.The article makes a comparative analysis of the participation of women in the fraternities and religious celebrations, and reveals that at the end of the colonial period there exists «distance between them» established by the economic, cultural and ethnical differences (Bourdieu 2000: 116), between the indigenous women of the rural world and the Spanish women of the elite and between the half-breed and Indian women of the urban shell. This study allows us to see that, while the voices of the female indigenous peasants of Purmamarca, Tumbaya or Cholacor enjoy themselves freely—and sometimes with the use of alcohol—in public spaces, where they work together with the men, and sing with periodical authority in the everyday life of the religious celebrations; the voices of the peasants of the cooperative and the indigenous women who make chicha in the San Salvador de Jujuy square are almost always dominated by a man, can pray their litany only in the chorus of the religious brotherhoods, in family life or in public work spaces which are authorized and controlled by men.
24
Jasper, Melinda Jane. "Paracrine regulation of ovarian function by granulocyte-macrophage colony-stimulating factor (GM-CSF) & colony-stimulating factor-1 (CSF-1) /." Title page and abstract only, 1998. http://web4.library.adelaide.edu.au/theses/09PH/09phj39.pdf.
Full text
25
Kuhr, Jan-Timm. "Statistical properties of microbial phenotypes and colony growth." Diss., lmu, 2012. http://nbn-resolving.de/urn:nbn:de:bvb:19-139733.
Full text
26
Barón, Elisabeth Matthies. "Mountain lake colony pinewood estate garden historic preservation." FIU Digital Commons, 2001. http://digitalcommons.fiu.edu/etd/1427.
Full textAbstract:
Pinewood Estate is a significant resource in the history of the theory and practice of landscape architecture. The purpose of this thesis is to provide a landscape plan to restore the Pinewood Estate to its historic integrity in order to retain and reflect its past.
In order to determine the criteria used to establish how and to what period the estate should be restored to, the Secretary of the Interior's Guidelines for the Treatment of Cultural Landscapes was followed. This process involved documenting the existing conditions of the estate. Site inventory and analysis and onsite interviews were conducted. Natural and cultural resources were evaluated.
As a case study, McKee Botanical Garden was analyzed and evaluated. The comparison of this case study served as a guideline to determine the best practice for the historical preservation of the estate.
Despite the changes in the landscape at Pinewood Estate over the past seventy years, the garden today still retains William Lyman Phillips design criteria. For the garden to continue to keep its historic fabric, rehabilitation was selected to allow for improvements that make possible efficient contemporary use of the estate.
27
Ganz, Shoshannah. "Canadian literary pilgrimage: From colony to post-nation." Thesis, University of Ottawa (Canada), 2006. http://hdl.handle.net/10393/29292.
Full textAbstract:
This thesis establishes the presence of pilgrimage in Canadian literature as reflective of Canadian cultural and global changes. It shows the enduring archetypal characteristics of pilgrimage from the earliest pre-Confederation travel writing to contemporary and postmodern novels. The topic of Canadian literary pilgrimage allows for an eclectic and necessarily multi-disciplinary approach and also for the study of the earliest Canadian letters and contemporary novelists, as well as for a breadth of forms, including journals, letters, archival sermons, dramatic works, poetry, and contemporary Canadian novels.
Chapter one begins with the cultural figure of Brebeuf as pilgrim first in The Jesuit Relations (1632-1673), proceeds to E. J. Pratt's long-poem Brebeuf and his Brethren (1940), on-site research at the memorial to Brebeuf in Midland, Ontario, and concludes with the post-colonial revisiting of this figure in James W. Nichol's dramatic work, Saint-Marie Among the Hurons (1980), and in Brian Moore's Black Robe (1985). Chapter two turns to Oliver Goldsmith's The Rising Village and explores Protestant pilgrimage, marking the material and spiritual progress of that pilgrimage. The thesis then looks at Goldsmith's work in conjunction with the influential sermons and journals of Bishop John Inglis of Nova Scotia. Chapter three follows pilgrimage into more contemporary works in Robertson Davies' Fifth Business and Jane Urquhart's The Stone Carvers, incorporating post-structuralist discussions of the nomad as pilgrim or anti-pilgrim figure and the implications of homelessness to the pilgrimage paradigm. Chapters four and five analyze Richard B. Wright's The Age of Longing and Clara Callan, and Timothy Findley's The Butterfly Plague and Headhunter, which are explored in light of some of Jacques Derrida's writing and the critical utopian studies of Ernst Bloch.
28
Kollin, Felix, and Adel Bavey. "Ant Colony Optimization Algorithms : Pheromone Techniques for TSP." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-208374.
Full textAbstract:
Ant Colony Optimization (ACO) uses behaviour observed in real-life ant colonies in order to solve shortest path problems. Short paths are found with the use of pheromones, which allow ants to communicate indirectly. There are numerous pheromone distribution techniques for virtual ant systems and this thesis studies two of the most well known, Elitist and Max-Min. Implementations of Elitist and Max-Min ACO algorithms were tested using instances of the Traveling Salesman Problem (TSP). The performance of the different techniques are compared with respect to runtime, iterations and approximation quality when the optimal solution could not be found. It was found that the Elitist strategy performs better on small TSP instances where the number of possible paths are reduced. However, Max-Min proved to be more reliable and better performing when more paths could be chosen or size of the instances increased. When approximating solutions for large instances, Elitist was able to achieve high quality approximations faster than Max-Min. On the other hand, the overall quality of the approximations were better when Max-Min was studied after a slightly longer runtime, compared to Elitist.Ant Colony Optimization (ACO) drar lärdom av beteende observerat hos riktiga myror för att lösa kortaste vägen problem. Korta vägar hittas med hjälp av feromoner, som tillåter myror att kommunicera indirekt. Det finns flera tekniker för att distribuera feromoner i virtuella myr-system och denna rapport kommer studera två av de mest kända, Elitist och Max-Min. Implementationer av Elitist och Max-Min ACO algoritmer testades med instanser av Handelsresandeproblemet (TSP). Prestandan hos de olika teknikerna jämförs med avseende på körtid, iterationer och approximeringskvalité när den optimala lösningen inte kunde hittas. Det konstaterades att Elitist strategin fungerar bättre på små TSP instanser där antalet möjliga stigar är begränsade. Däremot visade det sig Max-Min vara bättre och mer pålitlig när instansernas storlek ökades eller när fler stigar kunde väljas. När lösningar approximerades för stora instanser kunde Elitist uppnå approximationer med god kvalité snabbare än Max-Min. Däremot var den generella kvalitén hos approximationerna bättre när Max-Min studerades efter en lite längre körtid, jämfört med Elitist.
29
Blum, Christian. "Theoretical and practical aspects of ant colony optimization." Doctoral thesis, Universite Libre de Bruxelles, 2004. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/211187.
Full textAbstract:
Combinatorial optimization problems are of high academical as well as practical importance. Many instances of relevant combinatorial optimization problems are, due to their dimensions, intractable for complete methods such as branch and bound. Therefore, approximate algorithms such as metaheuristics received much attention in the past 20 years. Examples of metaheuristics are simulated annealing, tabu search, and evolutionary computation. One of the most recent metaheuristics is ant colony optimization (ACO), which was developed by Prof. M. Dorigo (who is the supervisor of this thesis) and colleagues. This thesis deals with theoretical as well as practical aspects of ant colony optimization.* A survey of metaheuristics. Chapter 1 gives an extensive overview on the nowadays most important metaheuristics. This overview points out the importance of two important concepts in metaheuristics: intensification and diversification.
* The hyper-cube framework. Chapter 2 introduces a new framework for implementing ACO algorithms. This framework brings two main benefits to ACO researchers. First, from the point of view of the theoretician: we prove that Ant System (the first ACO algorithm to be proposed in the literature) in the hyper-cube framework generates solutions whose expected quality monotonically increases with the number of algorithm iterations when applied to unconstrained problems. Second, from the point of view of the experimental researcher, we show through examples that the implementation of ACO algorithms in the hyper-cube framework increases their robustness and makes the handling of the pheromone values easier.
* Deception. In the first part of Chapter 3 we formally define the notions of first and second order deception in ant colony optimization. Hereby, first order deception corresponds to deception as defined in the field of evolutionary computation and is therefore a bias introduced by the problem (instance) to be solved. Second order deception is an ACO-specific phenomenon. It describes the observation that the quality of the solutions generated by ACO algorithms may decrease over time in certain settings. In the second part of Chapter 3 we propose different ways of avoiding second order deception.
* ACO for the KCT problem. In Chapter 4 we outline an ACO algorithm for the edge-weighted k-cardinality tree (KCT) problem. This algorithm is implemented in the hyper-cube framework and uses a pheromone model that was determined to be well-working in Chapter 3. Together with the evolutionary computation and the tabu search approaches that we develop in Chapter 4, this ACO algorithm belongs to the current state-of-the-art algorithms for the KCT problem.
* ACO for the GSS problem. Chapter 5 describes a new ACO algorithm for the group shop scheduling (GSS) problem, which is a general shop scheduling problem that includes among others the well-known job shop scheduling (JSS) and the open shop scheduling (OSS) problems. This ACO algorithm, which is implemented in the hyper-cube framework and which uses a new pheromone model that was experimentally tested in Chapter 3, is currently the best ACO algorithm for the JSS as well as the OSS problem. In particular when applied to OSS problem instances, this algorithm obtains excellent results, improving the best known solution for several OSS benchmark instances. A final contribution of this thesis is the development of a general method for the solution of combinatorial optimization problems which we refer to as Beam-ACO. This method is a hybrid between ACO and a tree search technique known as beam search. We show that Beam-ACO is currently a state-of-the-art method for the application to the existing open shop scheduling (OSS) problem instances.
Doctorat en sciences appliquées
info:eu-repo/semantics/nonPublished
30
Sharkey, Jeffrey Allen. "Automated radio network design using ant colony optimization." Thesis, Montana State University, 2008. http://etd.lib.montana.edu/etd/2008/sharkey/SharkeyJ0508.pdf.
Full textAbstract:
Radio networks can provide reliable communication for rural intelligent transportation systems (ITS). Engineers manually design these radio networks by selecting tower locations and equipment while meeting a series of constraints such as coverage, bandwidth, maximum delay, and redundancy, all while minimizing network cost. As network size and constraints grow, the design process can quickly become overwhelming. In this thesis we model the network design problem (NDP) as a generalized Steiner tree-star (GSTS) problem. Any solution to the minimum Steiner tree (MST) problem on a constructed GSTS graph will directly identify the tower locations and equipment needed to build the network at an optimal cost. The direct MST solution can only satisfy coverage constraints. Because the MST problem is known to be NP-hard, our research applies ant colony optimization (ACO) to find near-optimal MST solutions. Using ACO also allows us to meet bandwidth, maximum delay, and redundancy constraints. We verify that our approach finds near-optimal designs by comparing it against a 2-approximation algorithm in several different scenarios.
31
Belton, Douglas. "The Massachusetts Bay colony experience the Puritan hope /." Theological Research Exchange Network (TREN), 2006. http://www.tren.com/search.cfm?p001-1161.
Full text
32
Schultze, Martin [Verfasser]. "Constructing Subtests Using Ant Colony Optimization / Martin Schultze." Berlin : Freie Universität Berlin, 2017. http://d-nb.info/1138980714/34.
Full text
33
Werner, Jorn Martin. "NMR studies of human granulocyte colony-stimulating factor." Thesis, University of Oxford, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.242044.
Full text
34
Alathel, Deema. "Ant colony inspired models for trust-based recommendations." Thesis, The George Washington University, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3686815.
Full textAbstract:
The rapid growth of web-based social networks has led to many breakthroughs in the different services that can be provided by such networks. Some networks allow users to describe their relationships with other users beyond a basic connection. This dissertation focuses on trust in web-based social networks and how it can be utilized to enhance a user's experience within a recommender system. A definition of trust and its properties is presented followed by a detailed explanation of recommender systems, their application and techniques.
The recommendation problem in recommender systems is considered to be an optimization problem and thus many optimization algorithms can be used in such systems. The focus in this dissertation is specific to one group of such algorithms, ant algorithms, and an overview of how they can be applied to optimization problems is presented. While studying ant algorithms, it was noticed that an unprecedented improvement could be presented in the form of a local pheromone initialization technique, which is added to the list of contributions of this dissertation.
This dissertation presents a set of novel models that apply an ant-based algorithm to trust-based recommender systems. A total of five main models are presented where each model is designed with a specific purpose such as expanding the scope of the search in the solution space or dealing with cold start users, but ultimately all models aim to enhance the performance of the recommender system. In addition to the basic model, the enhanced models fall under two categories: localized models that increase the importance of trust within local computations, and dynamic models that increase the level of information sharing between the artificial agents in the system. The results of the conducted experiments are presented in this dissertation along with an analysis of the results highlighting the strengths of each model and the different situations in which each model is most suitable for application.
The dissertation concludes by discussing the lessons learned from the work presented and the possible extensions that can be added to the presented findings, which can contribute to the fields of recommender systems and artificial intelligence.
35
Foley, Charlotte Louise. "Characterisation of human prostate epithelium colony forming cells." Thesis, University College London (University of London), 2007. http://discovery.ucl.ac.uk/1444718/.
Full textAbstract:
Objectives: Rare prostate epithelial stem cells have been implicated in the aetiology of prostate disease, yet are overlooked in studies on the whole tissue. When prostate epithelial cells are cultured at low density, two distinct colony types arise, postulated to represent the progeny of stem cells (type II colonies) and committed 'transit amplifying' cells (type I). This project aimed to further characterize these rare colonies and confirm their position in the prostate epithelial cell hierarchy, in benign, and for the first time, malignant tissue. Methods: Colonies derived from transurethral resection tissue were compared for proliferation, differentiation, colony self-renewal and gene expression. Paired benign and malignant radical prostatectomy samples were cultured. To confirm the benign / malignant nature of individual colonies, loss of heterozygosity and expression of known prostate cancer markers were assessed. Results: There was a trend to greater type II colony proliferation, but no difference in ability to differentiate into multi-layered acinus-like structures expressing early and late epithelial markers. When passaged, type II colonies never re-created themselves, but resembled type I colonies. Using cDNA microarrays, comparison of gene expression in the two colony types showed a limited magnitude of differences, most notably in differentiation markers. Malignant tissue yielded both colony types, which were indistinguishable from their benign counterparts. Neither loss of heterozygosity analysis nor prostate cancer marker expression distinguished benign from malignant colonies. Conclusions: These colonies behave like differently-aged populations of transit amplifying cells - the committed offspring of the stem cell. If a stem cell does generate type II colonies, it appears to lose self-renewal ability and differentiate in culture. Colonies derived from cancer tissue show neither a malignant genotype nor phenotype suggesting that malignant cells are not cultured in these conditions. This highlights the need to confirm malignancy in primary prostate cancer cultures, hitherto assumed by many authors.
36
Askut, Ann Ahu. "Population-Based Ant Colony Optimization for Multivariate Microaggregation." NSUWorks, 2013. http://nsuworks.nova.edu/gscis_etd/81.
Full textAbstract:
Numerous organizations collect and distribute non-aggregate personal data for a variety of different purposes, including demographic and public health research. In these situations, the data distributor is responsible with the protection of the anonymity and personal information of individuals. Microaggregation is one of the most commonly used statistical disclosure control methods. In microaggregation, the set of original records is
first partitioned into several groups. The records in the same group are similar to each other. The minimum number of records in each group is k. Each record is replaced by the mean value of the group (centroid). The confidentiality of records is protected by ensuring that each group has at least a minimum of k records and each record is indistinguishable from at least k-1 other records in the microaggregated dataset. The goal
of this process is to keep the within-group homogeneity higher and the information loss lower, where information loss is the sum squared deviation between the actual records and the group centroids.
Several heuristics have been proposed for the NP-hard minimum information loss microaggregation problem. Among the most promising methods is the multivariate Hansen-Mukherjee (MHM) algorithm that uses a shortest path algorithm to identify the best partition consistent with a specified ordering of records. Developing improved heuristics for ordering multivariate points for microaggregation remains an open research
challenge.
This dissertation adapts a version of the population-based ant colony optimization algorithm (PACO) to order records within which MHM algorithm is used iteratively to improve the quality of grouping. Results of computational experiments using benchmark test problems indicate that P-ACO/MHM based microaggregation algorithm yields comparable or improved information loss than those obtained by extant methods.
37
Aidov, Alexandre. "Modified continuous ant colony algorithm for function optimization." FIU Digital Commons, 2008. http://digitalcommons.fiu.edu/etd/1166.
Full textAbstract:
Many classical as well as modern optimization techniques exist. One such modern method belonging to the field of swarm intelligence is termed ant colony optimization. This relatively new concept in optimization involves the use of artificial ants and is based on real ant behavior inspired by the way ants search for food. In this thesis, a novel ant colony optimization technique for continuous domains was developed. The goal was to provide improvements in computing time and robustness when compared to other optimization algorithms. Optimization function spaces can have extreme topologies and are therefore difficult to optimize. The proposed method effectively searched the domain and solved difficult single-objective optimization problems. The developed algorithm was run for numerous classic test cases for both single and multi-objective problems. The results demonstrate that the method is robust, stable, and that the number of objective function evaluations is comparable to other optimization algorithms.
38
Cotton, Fay Ellen. "Potential beaver colony density in parts of Québec." Thesis, Virginia Tech, 1990. http://hdl.handle.net/10919/42093.
Full textAbstract:
Three sets of linear regression models relating vegetation and hydrographic variables to observed beaver colony densities were developed for 3 study areas in Quebec where the effects of trapping on beaver densities were considered negligible. The first two study areas were located in mature northern hardwood forest. This research focused principally on the first study area, Papineau-Labelle Wildlife Reserve, where beaver colony density and habitat variables were studied at a 1:20,000 scale on 20 4-sq-km sample plots. Over 700 habitat variables were collected and generated from forest inventory maps, a computerized forest stand database, and base maps using a digitizer, microcomputer, mainframe and SAS programs. From the set of 32 models presented, the model explaining the most variation (95%) showed that beaver colony densities increased with density of stream length between 2% and 6% gradient and amount of wetland broadleaf cover forest area and decreased with forest stand area between 60 and 100 years of age. A set of decision rules was developed to help managers select the best model for determining beaver colony density according to availability, effort needed to measure and generalizability of the habitat information, and according to desired precision of the estimation. The model explaining the most variation (62%) in beaver colony numbers with the least measurement effort used total stream length measured from maps with the line intercept method.
In the second study area, Gatineau Park, hydrographic and shoreline vegetation variables in 63 4-sq-km quadrats were examined. The model explaining the most variation (35%) in beaver colony numbers showed that beaver colony densities increased with density of stream length in the 1 % to 10% gradient class. The third study area was located in the boreal forest of the St. Lawrence North Shore area and included 49 trapping units in which the effects of trapping on colony densities was considered negligible. Beaver density on the traplines was related to % cover as portrayed on 1: 50,000 scale MER summary forest inventory maps. Of the set of 4 models retained, the model explaining the most variation (61 %) in beaver colony numbers showed that beaver colony densities increased with the area of young broadleaf cover and the burnt area.
In the 2 mature northern hardwood study areas, hydrographic characteristics seemed to explain beaver colony density variations, whereas in the boreal forest where clearcutting and fires disturbed the forest, a significant portion of beaver colony density variation seemed to be explained by food abundance differences.
The sets of models in Papineau-Labelle and the St. Lawrence North Shore are considered of potential use to furbearer managers in Quebec because they provide a relatively low cost means to determine potential beaver colony densities.Master of Science
39
Ku, Chun-Ying. "Colony-Stimulating Factor from Umbilical Cord Endothelial Cells." Thesis, North Texas State University, 1987. https://digital.library.unt.edu/ark:/67531/metadc935638/.
Full textAbstract:
Conditioned media prepared from umbilical cord (UC) segments or endothelial cells (EC) contain colony stimulating activity, Both UCCM and ECCM were partially purified by DEAE-Sepharose and ACA44 gel filtration chromatography. The molecular weights were estimated as 25,000 and 31,000 for UC-CSF and EC-CSF, respectively. UC-CSF was further fractionated by Con A Sepharose, IEF and HPLC on a hydrophobic phenyl column. The highly purified CSF stimulates human macrophage and granulocyte colony formation, indicating it is GM-CSF in nature. Characterization studies have revealed that both CSFs are heat stable at 60°C for 30 min. They are sensitive to digestion by protease and to periodate oxidation but are stable to treatment with sulfhydryl reagents. The synthesis of CSF in endothelial cells is inhibited by actinomycin D, cycloheximide and puromycin, indicating that protein and RNA synthesis are required for CSF production. Among the mitogens tested, only LPS exhibited stimulatory activity on the production of CSF. Metabolic modulators such as dibutyryl cAMP, isobutylmethylxanthine, PGE2 and lactoferrin inhibit CSF production, while PGF2 enhances CSF production.
40
Mavrovouniotis, Michalis. "Ant colony optimization in stationary and dynamic environments." Thesis, University of Leicester, 2013. http://hdl.handle.net/2381/27971.
Full textAbstract:
The ant colony optimization (ACO) metaheuristic is inspired by the foraging behaviour of real ant colonies. Similarly with other metaheuristics, ACO suffers from stagnation behaviour, where all ants construct the same solution from early stages. In result, the solution quality may be degraded because the population may get trapped on local optima. In this thesis, we propose a novel approach, called direct communication (DC) scheme, that helps ACO algorithms to escape from a local optimum if they get trapped. The experimental results on two routing problems showed that the DC scheme is effective. Usually, researchers are focused on problems in which they have static environment. In the last decade, there is a growing interest to apply nature-inspired metaheuristics in optimization problems with dynamic environments. Usually, dynamic optimization problems (DOPs) are addressed using evolutionary algorithms. In this thesis, we apply several novel ACO algorithms in two routing DOPs. The proposed ACO algorithms are integrated with immigrants schemes in which immigrant ants are generated, either randomly or with the use of knowledge from previous environment(s), and replace other ants in the current population. The experimental results showed that each proposed algorithm performs better in different dynamic cases, and that they have better performance than other peer ACO algorithms in general. The existing benchmark generators for DOPs are developed for binary-encoded combinatorial problems. Since routing problems are usually permutation-encoded combinatorial problems, the dynamic environments used in the experiments are generated using a novel benchmark generator that converts a static problem instance to a dynamic one. The specific dynamic benchmark generator changes the fitness landscape of the problem, which causes the optimum to change in every environmental change. Furthermore in this thesis, another benchmark generator is proposed which moves the population to another location in the fitness landscape, instead of modifying it. In this way, the optimum is known and one can see how close to the optimum an algorithm performs during the environmental changes.
41
Roth, Galen. "The Colony a new work by Galen Roth /." Connect to resource, 2009. http://hdl.handle.net/1811/37253.
Full text
42
"In the Penal Colony." Master's thesis, 2011. http://hdl.handle.net/2286/R.I.9229.
Full textAbstract:
abstract: ABSTRACT "In the Penal Colony" is a three-act play based on the original short story by Franz Kafka and adapted by ASU MFA playwright Christian Krauspe. Told in flashback-form; a lone female Traveler arrives at a nameless penal colony where she is asked to comment on an old execution device known simply as, "the apparatus." She is pressured by the colonies administration to condone the practice while simultaneously asked to endorse the machine by her guiding officer in hopes of preserving the mystical powers the apparatus seems to possess. The Traveler must make the choice to endorse or condone the machine while she faces her own demons in the process.Dissertation/Thesis
M.F.A. Creative Writing 2011
43
Middendorf, Martin, Frank Reischle, and Hartmut Schmeck. "Multi Colony Ant Algorithms." 2002. https://ul.qucosa.de/id/qucosa%3A32027.
Full textAbstract:
In multi colony ant algorithms several colonies of ants cooperate in finding good solutions for an optimization problem. At certain time steps the colonies exchange information about good solutions. If the amount of exchanged information is not too large multi colony ant algorithms can be easily parallelized in a natural way by placing the colonies on different processors. In this paper we study the behaviour of multi colony ant algorithms with different kinds of information exchange between the colonies. Moreover we compare the behaviour of different numbers of colonies with a multi start single colony ant algorithm. As test problems we use the Traveling Salesperson problem and the Quadratic Assignment problem.
44
"The Natchitoches Art Colony: A southern en plein air art colony, 1921-1937." Tulane University, 1992.
Find full textAbstract:
The Natchitoches (Louisiana) Art Colony (1921-1937) was recognized as the first art colony of the South. Founded by Irma Sompayrac (Willard) and taught by Newcomb College (New Orleans, Louisiana) Art professors, Ellsworth Woodward and Will Henry Stevens, the colony was part of the movement to produce southern indigenous art. Originally an en plein air landscape school recognized locally, regionally and nationally, an arts and crafts local orientation resulted in the later (Depression) years. The group influenced the development and spread of other southern art colonies (including Melrose (Louisiana) Writers' and Artists' Colony) and established a public awareness and patronage for arts in the South. This is primarily a study of the background of the colony (in the context of the art colony concept) and the colony itself (founders, instructors, students, publicity, history); and not an evaluation of the few paintings (reproductions are included) foundacase@tulane.edu
45
"Artists' colony: A culture station." 1997. http://library.cuhk.edu.hk/record=b5889089.
Full textAbstract:
Lai Hing Fun Sandy."Architecture Department, Chinese University of Hong Kong, Master of Architecture Programme 1996-97, design report."
INTRODUCTION
PROLOGUE START
INITIAL APPROACH SITE INFORMATION
Chapter a. --- MACRO-SCALE
location
zoning
existing access
Chapter b. --- MICRO-SCALE
topography
problems on slope
vegetation
STRUGGLING DESIGN PROCESS
Chapter a. --- DESIGN ISSUES
Chapter 1. --- "Criteria and options checklist 1,2 &3"
Chapter 2. --- concerns for circulation
Chapter b. --- PINPOINT BUILDING LOCATION
Chapter 1. --- path
Chapter 2. --- altitude
Chapter 3. --- latitude
Chapter c. --- SLOPE-CUTTING
Chapter 1. --- ways of cutting slope
Chapter 2. --- volume of space gained vs. Volume of earth dig out.
Chapter d. --- POTENTIAL ACCESS
Chapter 1. --- vehicle
Chapter e. --- SETTING OUT
Chapter f. --- GRID
Chapter g. --- TRUSS
Chapter 1. --- design concept
Chapter 2. --- dimensions-1 & 2
Chapter 3. --- elevated height from slope
Chapter 4. --- Vertical fins of the truss match with the col.
Chapter 5. --- slab related with the truss
Chapter 6. --- bracing of the truss
Chapter h. --- SUPPORTING COLUMN
FINAL CONCEPT DESIGN ANALYSIS
Chapter a. --- SITE ACCESSIBILITY
Chapter 1. --- vehicle
Chapter 2. --- people
Chapter b. --- STRUCTURE
Chapter 1. --- supporting structure
Chapter 2. --- skin and material
Chapter 3. --- environmental consideration
Chapter c. --- ZONING
Chapter 1. --- space 1 & 2
Chapter 2. --- circulation
building as a whole 9th segment
Chapter 1. --- building as a whole
Chapter 2. --- segment
Chapter d. --- SERVICE
Chapter 1. --- building as a whole
Chapter 2. --- 9th segment
Chapter e. --- SPACE QUALITY
Chapter 1. --- along the cultural path
Chapter 2. --- inside building complex
Chapter 3. --- space details
EVALUATION
46
Cho, Tzu-Ling, and 卓子菱. "Fuzzy Artificial Bee Colony Algorithm." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/nb7jvw.
Full textAbstract:
碩士義守大學
資訊管理學系
105
This study discussed Artificial Bee Colony Algorithm(ABC) was proposed by Karaboga in 2005. This optimization algorithm has a stable convergence rate, solving capabilities and an amount of control parameters. Though ABC has many advantages, there are still has some problems, such as the regional situation and the slow convergence. Therefore, this study refers to the research of Improved ABC, presented Fuzzy Artificial Bee Colony Algorithm(FABC). This research utilized fuzzy theory and Differential Evolution to improve the searching capability and falling into local optimal solution. In addition, the FABC is combined with GABC(FGABC), which is expected to improve the accuracy of the solution. From the experimental results, it is show that FABC and FGABC have improved the situation of falling into the regional solution, so that it can be continuous and effective development.
47
Chen, Ya-Ling, and 陳雅玲. "Classification Rule Discovery Based on Ant Colony AlgorithmClassification Rule Discovery Based on Ant Colony Algorithm." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/17086737556265789520.
Full textAbstract:
碩士華梵大學
資訊管理學系碩士班
95
In recent years , Ant Colony Algorithm has been a hot topic of Dataming. It was published by Dorigo et al. since 1996 and applied in many different type of problems, like Traveling Salesman, Scheduling Problem, Multiple Knapsack, and so on. But it was related to Classification Rule Mining until 2002 by Parepinelli et al., called Ant-Miner (ant-colony-based data miner). This research is based on the Ant-Miner Algorithm. We put it into practice and improve it by changing station transition rule and adding the function of dealing with continuous attribute. Finally, the result of this study shows that, Ant-Miner after improving is not only be more convenient to use, but also the rate of correct is increasing.
48
Chou, Shin-Chang, and 周世章. "Ant Colony System Based Clustering Algorithms." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/01897124838415516873.
Full textAbstract:
碩士逢甲大學
交通工程與管理所
92
Cluster analysis is a traditional method of multivariate statistic classification. Cluster analysis is mainly to group all objects into several mutually exclusive clusters in order to make the degree of homogeneity within cluster and the degree of heterogeneity among clusters as high as possible. Cluster analysis is widely applied to many fields, such as pattern recognition, data analysis, image processing and market research. However, Cluster analysis is rapidly becoming computationally intractable as problem scale increases, because of the combinatorial character of the method. It has been proven that cluster analysis becomes an NP-hard problem when the number of clusters exceeds 3. Even the best algorithms developed for some specific objective functions, exhibit complexities of O(N3logN) or O(N3), leaving much room for improvement. Therefore, lots of heuristic algorithms have been proposed for cluster analysis. The performance of ant colony system developed by Dorigo et al. in 1996 based on the behaviors of nature ants out-searching for food has been proven in solving NP-hard and NP-complete combinatorial optimization problems, such as traveling salesman problem, vehicle routing problem, and quadratic assignment problem. This study attempts to propose and validate a clustering algorithm based on ant colony system, which is called ant-based clustering algorithm (ACA). For validating the performance of proposed algorithm in different scale of problems, three different scales of two-dimension data sets have been produced randomly, including small scale (10 samples), medium scale (50 samples) and large scale (100 samples). The comparison is also conducted by comparing its performance with that of agglomerative method, k-means method, and genetic clustering algorithm (GCA). In small scale problem, in addition to agglomerative method, all other three clustering algorithms can solve the optimum solution which is solved by the total enumeration method. In the medium and large scale problems with different number of clusters (3, 5, 7, 9 clusters), ACA statistically significantly outperforms than any other algorithms by 1.04%∼53.42%. GCA performs better than two statistic cluster analysis methods and agglomerative method have worst performance. However, no remarkable difference in the robustness, represented by standard error, has been observed for these four methods. In the case study, a total of 100 accident records data sets have been selected and 6 clustering variables which have significant influence on determining accident responsibility are selected by chi-square test. The results show that ACA still have the best performance in clustering this accidents data into 3 and 5 clusters.
49
Abourahme, Nasser. "Beneath the Concrete: Camp, Colony, Palestine." Thesis, 2019. https://doi.org/10.7916/d8-jgc8-2339.
Full textAbstract:
This dissertation is a material-archival history of the Palestinian refugee camp. Its primary claim is that to read Palestine-Israel one must read the camp; the refugee camp, I argue, is the settlercolony’s irreducible foil. How, then, has the question of the camps (neither synonymous with nor reducible to the ‘refugee problem’) exerted its own gravitational force on Palestinian, Israeli, and humanitarian politics? What kind of historical relation is there, I ask, between camp-form and that spatial form from which it seems inseparable—the colony? Working with a range of textual and visual documents (from bureaucratic reports to prose fiction and architectural drawings) drawn from four different archives, I argue that the Palestinian camps lie at the center of the foundational-temporal impasse of the Israeli state—its inability to decisively render the moment of its inception as past. In other words, my argument is that the camp sits not only at the intersection of the most critical biopolitical sites of the settler- colonial—the colonized body and its movements, land and its possession in regimes of property and ownership—but, and perhaps even more consequentially, at the point of their temporal resolution in definite and final forms. Camp and colony are entangled from the start; co-produced in the double movement of dispossession and substitution, un-homing and homing; twinned but inversed topologies of the freedom of movement.
50
Melo, Leonor Isabel de Albuquerque. "Self Adaptation in Ant Colony Optimisation." Doctoral thesis, 2019. http://hdl.handle.net/10316/87416.
Full textAbstract:
Tese de Doutoramento em Ciências e Tecnologias da Informação, apresentada ao Departamento de Engenharia Informática da Faculdade de Ciências e Tecnologia da Universidade de CoimbraACO is a global metaheuristic loosely inspired by the behaviour of social ants. Several variants were proposed over the past two decades and, throughout this period, they have been successfully applied to solve difficult combinatorial optimisation problems. Notwith- standing its relevance in optimisation, ant colony algorithms have several well-known drawbacks. One important limitation is that they tend to be particularly sensitive to pa- rameterisation and different settings may obtain significant different results on the same situation. Also, they have strong greedy components that can easily lead to the loss of diversity and to premature convergence. This dissertation proposes two novel self-adaptive ant algorithms. Both of them rely on the coexistence of heterogeneous groups of ants within a single optimisation framework, each set with its own search strategy. Moreover, the search strategy is not fixed and, in- stead, the algorithms can autonomously adapt their behaviour to the different stages of the optimisation problem being solved. On-line self-adaptation has two crucial advan- tages: it frees the practitioner from having to carefully define settings for each specific optimisation situation and it grants the algorithm the ability to adjust its behaviour in accordance to the structure of the search landscape. The first contribution is MC-Ant, a multi-colony ant algorithm. Each colony is defined as a group of ants with its own search settings and acquired knowledge. Different colonies coexist in the algorithm while independently solving a problem. Periodically, good quality solutions migrate and effective search strategies are shared. Results obtained with the NPP show that MC-Ant outperforms single colony approaches, reinforcing the relevance of migration to avoid premature convergence and to allow an effective parameter self- adaptation. Multi-caste ACS is the second contribution of the work. It is an alternative self- adaptive, multi-strategy ACO approach, designed in such a way as to avoid a few efficiency issues exhibited by MC-Ant. In this framework, ants are divided in castes, and each caste has its own q0 value, a critical parameter to define the search strategy. Ants can migrate between castes according to some simple rules and this allows the algorithm to autonomously adjust its search strategy achieving a suitable balance between exploitation and exploration. Multi-caste ACS was applied to the symmetric TSP, both to the static and to the periodic and non-cyclic dynamic variants. Results confirm the advantage of the heterogeneous approach. Standard ACO variants excel in a subset of the optimisation scenarios but fail completely on others. On the contrary, Multi-caste approaches are extremely robust and are able to keep a balanced performance across all optimisation scenarios considered. This robustness is particularly evident in the dynamic environments.
A otimização baseada em colónias de formigas (ACO) é uma metaheurística global vaga- mente inspirada no comportamento social das formigas. Múltiplas variantes foram propos- tas ao longo das últimas duas décadas e, durante esse período, têm vindo a ser aplicadas com sucesso na resolução de problemas difíceis de otimização combinatória. Contudo, e apesar da sua relevância na área da otimização, os algoritmos de colónias de formigas pos- suem alguns inconvenientes conhecidos. Uma limitação importante é a sua sensibilidade à parametrização, de tal modo que, para uma dada situação, diferentes configurações po- dem obter resultados significativamente diferentes. Além disso, as componentes sôfregas do algoritmo podem facilmente levar à perda de diversidade e à convergência prematura. Esta dissertação propõe dois novos algoritmos auto-adaptativos baseados em colónias de formigas. Ambas as propostas se baseiam na coexistência de grupos heterogéneos de formigas para a resolução de um mesmo problema de otimização, mas em que cada grupo possui a sua própria estratégia de pesquisa. Além disso a estratégia de pesquisa não é fixa e os algoritmos podem adaptar, de forma autónoma, o seu comportamento às diversas fases da resolução do problema de otimização. A auto-adaptação em tempo real (on-line) tem duas vantagens cruciais: liberta o utilizador da necessidade de definir cuidadosamente as configurações para cada situação de otimização específica, e concede ao algoritmo a capacidade de ajustar o seu comportamento de acordo com a estrutura do espaço de pesquisa. A primeira contribuição é o MC-Ant, um algoritmo de formigas com várias colónias. Cada colónia consiste num grupo de formigas com as suas próprias configurações e co- nhecimento adquirido. As diferentes colónias existem em simultâneo e resolvem de forma independente o mesmo problema. Periodicamente são partilhadas soluções de boa quali- dade e estratégias de pesquisa. Os resultados obtidos com o NPP mostram que o MC-Ant tem um desempenho superior a abordagens de colónia única, reforçando a relevância da migração para evitar a convergência prematura e permitir uma auto-adaptação eficaz. O Multi-caste ACS é a segunda contribuição deste trabalho. É uma abordagem ACO multi-estratégica e auto-adaptativa alternativa, concebida de forma a evitar alguns pro- blemas de eficiência apresentados pelo MC-Ant. As formigas são divididas em castas, e cada casta tem o seu próprio q0, um parâmetro crucial na definição da estratégia de pesquisa. As formigas podem migrar entre castas de acordo com algumas regras simples. Deste modo, permite-se que o algoritmo ajuste a sua estratégia de pesquisa de forma au- tónoma e alcance um equilíbrio adequado entre a utilização do conhecimento adquirido e a exploração de novas áreas do espaço de pesquisa. O Multi-caste ACS foi aplicado ao TSP simétrico, tanto à versão estática como à ver- são dinâmica, periódica e não cíclica do problema. Os resultados confirmam a vantagem da abordagem heterogénea. As variantes clássicas dos ACO são eficazes num subcon- junto de cenários de otimização, mas falham completamente em outros. Pelo contrário, abordagens com várias castas são extremamente robustas e são capazes de manter um desempenho equilibrado em todos os cenários de otimização considerados. Essa robustez é particularmente evidente em ambientes dinâmicos.