Dissertations / Theses on the topic 'Discovery'
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 'Discovery.'
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.
Keck, Andrew G. "Electronic discovery." Thesis, Utica College, 2016. http://pqdtopen.proquest.com/#viewpdf?dispub=10101099.
Full textCyber incidents continue to increase across the entire globe. The increase in security threats requires organizations to rethink strategies and policies continually fortifying against known and unknown threats. Cyber incident policies and response plans range from non-existent to hundreds of pages in length. A policy may include sections discussing roles and responsibility, incident detection, escalation, and many additional categories, and often discuss the collection and preservation of forensic evidence. Policies briefly address, in many cases, the proper collection of evidence; however, the written regulation concerning the potential liabilities, the risks associated with current and future litigation, and the legal consequences to a cyber incident remains sparse. The desired outcome of this paper is to enlighten the reader through identification of the risks, the potential pitfalls, and steps to policy development pertaining to the handling of electronic evidence, with a cross examination of overlapping sectors between forensics, electronic discovery, and cyber security.
Firriolo, Marco. "Discovery copy." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/8224/.
Full textMcCoy, Jan. "Outdoor Discovery." College of Agriculture, University of Arizona (Tucson, AZ), 1989. http://hdl.handle.net/10150/295610.
Full textWendel, Patrick. "The architecture of discovery net : towards grid-based discovery services." Thesis, Imperial College London, 2008. http://hdl.handle.net/10044/1/7708.
Full textHildebrandt, Leonore S. "A Small Discovery." Fogler Library, University of Maine, 2004. http://www.library.umaine.edu/theses/pdf/HildebrandtLS2004.pdf.
Full textCheng, Peter C.-H. "Modelling scientific discovery." Thesis, Open University, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.256257.
Full textEriksson, Gustav, and Martin Kevin Garcia. "Discovery of Neptune." Thesis, KTH, Skolan för teknikvetenskap (SCI), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-230700.
Full textDetta projekt är en analys om hur en planet kan hittas i rymden med hjälp av matematik. Det är baserat på två matematiker, John C. Adams och Urbain Le Verrier, som på 1800-talet oberoende av varandra hittade Neptunus, den åttonde planeten i solsystemet, genom att approximera dess position baserat på avvikelser mellan teoretiska och observerade longituder. Vi återskapar Adams problem och löser det med numerisk analys för att se hur man kan förbättra metoden att hitta planeter genom matematik. Vi skapade en modell av solsystemet med Runge-Kutta 4 (RK4) för att lösa ODE’s som beskriver hur planeterna påverkar varandra. Sedan skapar vi ett inverterat problem där vi låtsas om att Neptunus inte finns och försöker hitta dess position med Gauss-Newtons algoritm. Vår metod ger ett bättre resultat än Adams, vilket beror på att vi använder en bättre startgissning för Neptunus position. Den viktiga parametern att hitta är vid vilken vinkel man ska kolla efter planeten, även kallat longitudvinkeln. Både Adams och vi kommer nära det riktiga värdet --Adams är 2,5 ifrån och vi är inom 1. Detta är särskilt intressant eftersom de aldrig skulle hittat planeten utan denna parameter.
Taylor, Jonathan Lorin. "Lines of Discovery." Thesis, Virginia Tech, 2004. http://hdl.handle.net/10919/35461.
Full textMaster of Architecture
Oliveira, Olga Margarida Fajarda. "Network topology discovery." Doctoral thesis, Universidade de Aveiro, 2017. http://hdl.handle.net/10773/18692.
Full textA monitorização e avaliação do desempenho de uma rede são essenciais para detetar e resolver falhas no seu funcionamento. De modo a conseguir efetuar essa monitorização, e essencial conhecer a topologia da rede, que muitas vezes e desconhecida. Muitas das técnicas usadas para a descoberta da topologia requerem a cooperação de todos os dispositivos de rede, o que devido a questões e políticas de segurança e quase impossível de acontecer. Torna-se assim necessário utilizar técnicas que recolham, passivamente e sem a cooperação de dispositivos intermédios, informação que permita a inferência da topologia da rede. Isto pode ser feito recorrendo a técnicas de tomografia, que usam medições extremo-a-extremo, tais como o atraso sofrido pelos pacotes. Nesta tese usamos métodos de programação linear inteira para resolver o problema de inferir uma topologia de rede usando apenas medições extremo-a-extremo. Apresentamos duas formulações compactas de programação linear inteira mista (MILP) para resolver o problema. Resultados computacionais mostraram que a medida que o número de dispositivos terminais cresce, o tempo que as duas formulações MILP compactas necessitam para resolver o problema, também cresce rapidamente. Consequentemente, elaborámos duas heurísticas com base nos métodos Feasibility Pump e Local ranching. Uma vez que as medidas de atraso têm erros associados, desenvolvemos duas abordagens robustas, um para controlar o número máximo de desvios e outra para reduzir o risco de custo alto. Criámos ainda um sistema que mede os atrasos de pacotes entre computadores de uma rede e apresenta a topologia dessa rede.
Monitoring and evaluating the performance of a network is essential to detect and resolve network failures. In order to achieve this monitoring level, it is essential to know the topology of the network which is often unknown. Many of the techniques used to discover the topology require the cooperation of all network devices, which is almost impossible due to security and policy issues. It is therefore, necessary to use techniques that collect, passively and without the cooperation of intermediate devices, the necessary information to allow the inference of the network topology. This can be done using tomography techniques, which use end-to-end measurements, such as the packet delays. In this thesis, we used some integer linear programming theory and methods to solve the problem of inferring a network topology using only end-to-end measurements. We present two compact mixed integer linear programming (MILP) formulations to solve the problem. Computational results showed that as the number of end-devices grows, the time need by the two compact MILP formulations to solve the problem also grows rapidly. Therefore, we elaborate two heuristics based on the Feasibility Pump and Local Branching method. Since the packet delay measurements have some errors associated, we developed two robust approaches, one to control the maximum number of deviations and the other to reduce the risk of high cost. We also created a system that measures the packet delays between computers on a network and displays the topology of that network.
Seneviratne, Dilesha Nilakshi. "Patent link discovery." Thesis, Queensland University of Technology, 2019. https://eprints.qut.edu.au/131137/1/Dilesha%20Nilakshi%20Seneviratne_Dissanayake%20Wasala%20Mudiyanselage%20Hakmana%20Walawwe_Thesis.pdf.
Full textWuitschik, Georg. "Oxetanes in drug discovery /." Zürich : ETH, 2008. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=17929.
Full textViswanathan, Murlikrishna. "Towards robust discovery systems." Monash University, School of Computer Science and Software Engineering, 2003. http://arrow.monash.edu.au/hdl/1959.1/9397.
Full textHeeks, Richard James. "Discovery writing and genre." Thesis, University of Exeter, 2012. http://hdl.handle.net/10871/13802.
Full textBright, Kerrin John. "Fragment-based hit discovery." Thesis, University of York, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.516627.
Full textScherrer, Cristina Mabel. "Essays on price discovery." Thesis, Queen Mary, University of London, 2013. http://qmro.qmul.ac.uk/xmlui/handle/123456789/8673.
Full textZeidan, Bashar. "Breast cancer biomarker discovery." Thesis, University of Southampton, 2013. https://eprints.soton.ac.uk/360029/.
Full textBuettner-Graefenhain, Christine. "Discovery Food - Culinary Architecture." Thesis, Virginia Tech, 2005. http://hdl.handle.net/10919/32579.
Full textMaster of Architecture
Vilo, Jaak. "Pattern discovery from biosequences." Helsinki : University of Helsinki, 2002. http://ethesis.helsinki.fi/julkaisut/mat/tieto/vk/vilo/.
Full textMurty, Paul. "Discovery processes in designing." Thesis, The University of Sydney, 2006. http://hdl.handle.net/2123/1809.
Full textMurty, Paul. "Discovery processes in designing." Connect to full text, 2006. http://hdl.handle.net/2123/1809.
Full textThis thesis describes an interview study of forty five professionally accomplished male and female designers and architects. The study considers how each respondent designs and makes discoveries throughout conceptual design. How they start designing, what they attempt to achieve, the means they employ, how they cope with getting stuck, their breakthroughs and discoveries and the circumstances of these experiences, are the main ingredients of the study. The aim of the research is to estimate the extent to which designing may be regarded as an insightful activity, by investigating experiences of discoveries as reported by the respondents. Throughout the thesis, discoveries or ideas occurring to respondents when they are not actively designing, an apparent outcome of a latent designing or preparation activity, are referred to as cold discoveries. This label is used to distinguish these discoveries from discoveries that emerge in the run of play, when individuals are actively designing. The latter are referred to as hot discoveries. The relative insightfulness of hot and cold discoveries is also investigated. In general, the evidence from the research suggests that designing is significantly insightful. Most respondents (39:45) reported experiences of insights that have contributed to their designing. In addition there is strong evidence that cold discoveries are considerably more important, both quantitatively and qualitatively, than is currently recognized. More than half of the respondents (25:45) reported the experience of cold discoveries, many after disengaging from designing, when they had been stuck. Being stuck means they were experiencing frustration, or had recognised they were not making satisfactory progress in attempts to resolve some aspect of conceptual design. Typically these respondents reported experiencing discoveries while doing other work, performing some physical activity, resting, or very soon after resuming work. They had elected to let ideas come to them, rather than persist in searching and this strategy was successful. Moreover, many respondents (10:45) described positive attributes of cold discoveries using terms such as stronger, more potent, or pushes boundaries, which suggest their cold discoveries are more insightful than their hot discoveries. Many respondents associated their cold discoveries with mental activities such as incubation, a concept identified by Gestalt theorists nearly a century ago. They used a range of informal terms, such as ideas ticking over, or percolating away. These apparently uncontrolled mental experiences, which I refer to generically as latent preparation, varied from one respondent to another in when, where and how they occurred. Latent preparation or its outcomes, in the form of interruptive thoughts, apparently takes place at any time and during different states of consciousness and attentiveness. It appears to be, at different times, unplanned, unintentional, undirected, unnoticed, or unconscious, in combinations, not necessarily all at once. It is clearly not only an unconscious process. This suggests one, or more of the following; 1) that incubation is only a component of latent preparation, or 2) that the conventional view of incubation, as an unconscious process, does not adequately account for the range of insightful experiences of mentally productive people, such as designers, or 3) that the old issue of whether incubation is a conscious, or an unconscious process, is not vital to a systematic investigation of insightful discovery. The thesis concludes by considering prospects for further research and how the research outcomes could influence education. Apart from the findings already described, statements by the respondents about personal attributes, designing, coping with being stuck and discoveries, were wide ranging, resourceful and down-to-earth, suggesting there are many ways for individuals to become proficient, creative designers at the high end of their profession. A major implication for future research is that latent preparation may be found as readily among highly motivated and skilled individuals in other occupations unrelated to architecture or designing. The evidence of the research so far suggests there is much to be learned about latent preparation that can be usefully applied, for the benefit of individuals aiming to be designers, or simply wanting to become more adept at intervening, transforming and managing unexpected and novel situations of any kind.
Furletti, Barbara. "Ontology-driven knowledge discovery." Thesis, IMT Alti Studi Lucca, 2009. http://e-theses.imtlucca.it/22/1/Furletti_phdthesis.pdf.
Full textSen, Sagar. "Automatic effective model discovery." Rennes 1, 2010. http://www.theses.fr/2010REN1S042.
Full textScientific discovery often culminates into representing structure in nature as networks (graphs) of objects. For instance, certain biological reaction networks aim to represent living processes such as burning fat or switching genes on/off. Knowledge from experiments, data analysis and mental tacit lead to the discovery of such effective structures in nature. Can this process of scientific discovery using various sources of knowledge be automated? In this thesis, we address the same question in the contemporary context of model-driven engineering (MDE) of complex software systems. MDE aims to grease the wheels of complex software creation using first class artifacts called models. Very much like the process of effective structure discovery in science a modeler creates effective models, representing useful software artifacts, in a modelling domain. In this thesis, we consider two such modelling domains: metamodels for modelling languages and feature diagrams for Software Product Lines (SPLs). Can we automate effective model discovery in a modelling domain? The central challenge in discovery is the automatic generation of models. Models are graphs of inter-connected objects with constraints on their structure and the data contained in them. These constraints are enforced by a modelling domain and heterogeneous sources of knowledge including several well-formedness rules. How can we automatically generate models that simultaneously satisfy these constraints? In this thesis, we present a model-driven framework to answer this question. The framework for automatic model discovery uses heterogeneous sources of knowledge to first setup a concise and relevant subset of a modelling domain specification called the effective modelling domain. Next, it transforms the effective modelling domain defined in possibly different languages to a constraint satisfaction problem in the unique formal specification language Alloy. Finally, the framework invokes a solver on the Alloy model to generate one or more effective models. We embody the framework in two tools: Cartier for model discovery in any modelling language and Avishkar for product discovery in a SPL. We validate our framework through rigorous experiments in test model generation, partial model completion, product generation in SPLs, and generation of web-service orchestrations. The results qualify that our framework consistently generates effective findings in modelling domains from commensurate case studies
Schnejder, Rasmus. "Price discovery i valutamarkedet : en empirisk analyse = Price discovery in the foreign exchanger market /." Aarhus : Institut for Økonomi, Aarhus Universitet, 2009. http://mit.econ.au.dk/Library/Specialer/2009/20040581.pdf.
Full textSchiess, Ralph. "Proteomic strategy for biomarker discovery /." Zürich : ETH, 2008. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=18097.
Full textSmith, Steven Lee Al-Mahmood Mohammed Abdul latif. "Knowledge discovery using genetic programming /." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1993. http://handle.dtic.mil/100.2/ADA276224.
Full textThesis advisor(s): B. Ramesh ; William R. Gates. "December 1993." Includes bibliographical references. Also available online.
Saffell, Matthew John. "Knowledge discovery for time series /." Full text open access at:, 2005. http://content.ohsu.edu/u?/etd,247.
Full textHöppner, Frank. "Knowledge discovery from sequential data." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=96728421X.
Full textSandve, Geir Kjetil. "Motif discovery in biological sequences." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2005. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9270.
Full textThis master thesis is a Ph.D. research plan for motif discovery in biological sequences, and consists of three main parts. Chapter 2 is a survey of methods for motif discovery in DNA regulatory regions, with a special emphasis on computational models. The survey presents an integrated model of the problem that allows systematic and coherent treatment of the surveyed methods. Chapter 3 presents a new algorithm for composite motif discovery in biological sequences. This algorithm has been used with success for motif discovery in protein sequences, and will in future work be extended on to explore properties of the DNA regulatory mechanism. Finally, chapter 4 describes several current research projects, as well as some more general future directions of research. The research focuses on the development of new algorithms for the discovery of composite motifs in DNA. These algorithms will partly be used for systematic exploration of the DNA regulatory mechanism. An increased understanding of this mechanism may lead to more accurate computational models, and hence more sensitive motif discovery methods.
Meyer, Quinton Christian. "Metagenomic approaches to gene discovery." Thesis, University of the Western Cape, 2006. http://etd.uwc.ac.za/index.php?module=etd&action=viewtitle&id=gen8Srv25Nme4_7031_1182747173.
Full textThe classical approach to gene discovery has been to culture micro-organisms demonstrating a specific enzyme activity and then to recover the gene of interest through shotgun cloning. The realization that these standard microbiological methods provide limited access to the true microbial biodiversity and therefore the available microbial genetic diversity (collectively termed the Metagenome) has resulted in the development of environmental nucleic acid extraction technologies designed to access this wealth of genetic information, thereby avoiding the limitations of culture dependent genetic exploitation. In this work several gene discovery technologies was employed in an attempt to recover novel bacterial laccase genes (EC 1.10.3.2), a group of enzymes in which considerable biotechnological interest has been expressed. Metagenomic DNA extracted from two organic rich environmental samples was used as the source material for the construction of two genomic DNA libraries. The small insert plasmid based library derived from compost DNA consisted of approximately 106 clones at an average insert size of 2.7Kbp, equivalent to 2.6 Gbp of cloned environmental DNA. A Fosmid based large insert library derived from grape waste DNA consisted of approximately 44000 cfu at an average insert size of 25Kbp (1.1 Gbp cloned DNA). Both libraries were screened for laccase activity but failed to produce novel laccase genes. As an alternative approach, a multicopper oxidase specific PCR detection assay was developed using a laccase positive Streptomyces strain as a model organism. The newly designed primers were used to detect the presence of bacterial multicopper oxidases in environmental samples. This resulted in the identification of nine novel gene fragments showing identity ranging from 37 to 94% to published putative bacterial multicopper oxidase gene sequences. Three clones pMCO6, pMCO8 and pMCO9 were significantly smaller than those typically reported for bacterial laccases and were assigned to a recently described clade of Streptomyces bacterial multicopper oxidases.
Two PCR based techniques were employed to attempt the recovery of flanking regions for two of these genes (pMCO7 and pMCO8). The use of TAIL-PCR resulted in the recovery of 90% of the pMCO7 ORF. As an alternative approach the Vectorette&trade
system was employed to recover the 3&rsquo
downstream region of pMCO8. The complexity of the DNA sample proved to be a considerable technical challenge for the implementation of both these techniques. The feasibility of both these approaches were however demonstrated in principle. Finally, in an attempt to expedite the recovery of fulllength copies of these genes a subtractive hybridization magnetic bead capture technique was adapted and employed to recover a full &ndash
length putative multicopper oxidase gene from a Streptomyces strain in a proof of concept experiment. The StrepA06pMCO gene fragment was used as a &lsquo
driver&rsquo
against fragmented Streptomyces genomic DNA (&lsquo
tester&rsquo
) and resulted in the recovery of a 1215 bp open reading frame. Unexpectedly, this ORF showed only 80% identity to the StrepA06pMCO gene sequence at nucleotide level, and 48% amino acid identity to a putative mco gene derived from a Norcardioides sp JS614.
Webber, James Trubek. "Cancer Bioinformatics for Biomarker Discovery." Thesis, University of California, San Francisco, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10604636.
Full textCancer is a complex and multifaceted disease, and a vast amount of time and effort has been spent on characterizing its behaviors, identifying its weaknesses, and discovering effective treatments. Two major obstacles stand in the way of progress toward effective precision treatment for the majority of patients.
First, cancer's extraordinary heterogeneity—both between and even within patients—means that most patients present with a disease slightly different from every previously recorded case. New methods are necessary to analyze the growing body of patient data so that we can classify each new patient with as much accuracy and precision as possible. In chapter 2 I present a method that integrates data from multiple genomics platforms to identify axes of variation across breast cancer patients, and to connect these gene modules to potential therapeutic options. In this work we find modules describing variation in the tumor microenvironment and activation of different cellular processes. We also illustrate the challenges and pitfalls of translating between model systems and patients, as many gene modules are poorly conserved when moving between datasets.
A second problem is that cancer cells are constantly evolving, and many treatments inevitably lead to resistance as new mutations arise or compensatory systems are activated. To overcome this we must find rational combinations that will prevent resistant adaptation before it can start. Starting in chapter 3 I present a series of projects in which we used a high-throughput proteomics approach to characterize the activity of a large proportion of protein kinases, ending with the discovery of a promising drug combination for the treatment of breast cancer in chapter 8.
Yu, Xiaobo. "Knowledge discovery in Internet databases." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/mq30577.pdf.
Full textMiller, Stephanie. "Masks, a journey for discovery." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0027/MQ51420.pdf.
Full textHan, Jianchao. "Interactive visualization for knowledge discovery." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/NQ60540.pdf.
Full textSundramoorthy, Vasughi. "At home in service discovery." Enschede : University of Twente [Host], 2006. http://doc.utwente.nl/57341.
Full textCao, Huiping. "Pattern discovery from spatiotemporal data." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B37381520.
Full textLeung, Chi-ming. "Motif discovery for DNA sequences." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B3859755X.
Full textGovorukhina, Natalia I. "Biomarker discovery for cervical cancer." [S.l. : Groningen : s.n. ; University Library of Groningen] [Host], 2007. http://irs.ub.rug.nl/ppn/305362089.
Full textKehoe, Peggy. "Self discovery and personal creation /." Online version of thesis, 1991. http://hdl.handle.net/1850/11073.
Full textBauckmann, Jana. "Dependency discovery for data integration." Phd thesis, Universität Potsdam, 2013. http://opus.kobv.de/ubp/volltexte/2013/6664/.
Full textDatenintegration hat das Ziel, Daten aus unterschiedlichen Quellen zu kombinieren und Nutzern eine einheitliche Sicht auf diese Daten zur Verfügung zu stellen. Diese Aufgabe ist gleichermaßen anspruchsvoll wie wertvoll. In dieser Dissertation werden Algorithmen zum Erkennen von Datenabhängigkeiten vorgestellt, die notwendige Informationen zur Datenintegration liefern. Der Schwerpunkt dieser Arbeit liegt auf Inklusionsabhängigkeiten (inclusion dependency, IND) im Allgemeinen und auf der speziellen Form der Bedingten Inklusionsabhängigkeiten (conditional inclusion dependency, CIND): (i) INDs ermöglichen das Finden von Strukturen in einem gegebenen Schema. (ii) INDs und CINDs unterstützen das Finden von Referenzen zwischen Datenquellen. Eine IND „A in B“ besagt, dass alle Werte des Attributs A in der Menge der Werte des Attributs B enthalten sind. Diese Arbeit liefert einen Algorithmus, der alle INDs in einer relationalen Datenquelle erkennt. Die Herausforderung dieser Aufgabe liegt in der Komplexität alle Attributpaare zu testen und dabei alle Werte dieser Attributpaare zu vergleichen. Die Komplexität bestehender Ansätze ist abhängig von der Anzahl der Attributpaare während der hier vorgestellte Ansatz lediglich von der Anzahl der Attribute abhängt. Damit ermöglicht der vorgestellte Algorithmus unbekannte Datenquellen mit großen Schemata zu untersuchen. Darüber hinaus wird der Algorithmus erweitert, um drei spezielle Formen von INDs zu finden, und ein Ansatz vorgestellt, der Fremdschlüssel aus den erkannten INDs filtert. Bedingte Inklusionsabhängigkeiten (CINDs) sind Inklusionsabhängigkeiten deren Geltungsbereich durch Bedingungen über bestimmten Attributen beschränkt ist. Nur der zutreffende Teil der Instanz muss der Inklusionsabhängigkeit genügen. Die Definition für CINDs wird in der vorliegenden Arbeit generalisiert durch die Unterscheidung von überdeckenden und vollständigen Bedingungen. Ferner werden Qualitätsmaße für Bedingungen definiert. Es werden effiziente Algorithmen vorgestellt, die überdeckende und vollständige Bedingungen mit gegebenen Qualitätsmaßen auffinden. Dabei erfolgt die Auswahl der verwendeten Attribute und Attributkombinationen sowie der Attributwerte automatisch. Bestehende Ansätze beruhen auf einer Vorauswahl von Attributen für die Bedingungen oder erkennen nur Bedingungen mit Schwellwerten von 100% für die Qualitätsmaße. Die Ansätze der vorliegenden Arbeit wurden durch zwei Anwendungsbereiche motiviert: Datenintegration in den Life Sciences und das Erkennen von Links in Linked Open Data. Die Effizienz und der Nutzen der vorgestellten Ansätze werden anhand von Anwendungsfällen in diesen Bereichen aufgezeigt.
Ping, Dongsheng. "Peptidylamidoglycolate lyase : discovery and characterization." Diss., Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/30012.
Full textSyed, Jameel Amjad. "Information structuring for managing discovery." Thesis, Imperial College London, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.445304.
Full textStoops, David. "Rule discovery from swarm systems." Thesis, University of Ulster, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.550967.
Full textCao, Huiping, and 曹會萍. "Pattern discovery from spatiotemporal data." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2006. http://hub.hku.hk/bib/B37381520.
Full textLeung, Chi-ming, and 梁志銘. "Motif discovery for DNA sequences." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2006. http://hub.hku.hk/bib/B3859755X.
Full textCafcules, Stephanie Tyler. "An eddy of self discovery." Honors in the Major Thesis, University of Central Florida, 2010. http://digital.library.ucf.edu/cdm/ref/collection/ETH/id/1371.
Full textBachelors
Arts and Humanities
Fine Arts
Smith, Steven Lee, and Mohammed Abdul latif Al-Mahmood. "Knowledge discovery using genetic programming." Thesis, Monterey, California. Naval Postgraduate School, 1993. http://hdl.handle.net/10945/26608.
Full textColquhoun, Joy Allison. "Discovery of deep-sea actinomycetes." Thesis, University of Kent, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.263699.
Full textBell, D. A. "Information handling and pattern discovery." Thesis, University of Ulster, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.245331.
Full textCARVALHO, FELIPE OLIVEIRA. "CONTINUOUS SERVICE DISCOVERY IN IOT." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2017. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=30746@1.
Full textCOORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
PROGRAMA DE EXCELENCIA ACADEMICA
A popularização da Internet das Coisas (IoT, Internet of Things) provocou uma crescente oportunidade para a criação de aplicações em diversas áreas, através da combinação do uso de sensores e/ou atuadores. Em ambientes de IoT, o papel de elementos chamados de gateways consiste em fornecer uma camada de comunicação intermediária entre os dispositivos de IoT e serviços de nuvem. Um fator crucial para a construção de aplicações em larga escala é que os dispositivos de IoT possam ser utilizados de maneira transparente, num paradigma orientado a serviços, onde detalhes de comunicação e configuração destes objetos são tratados pelos gateways. No modelo de serviços, as aplicações devem descobrir as interfaces de alto-nível dos dispositivos e não precisam lidar com detalhes subjacentes, que são tratados pelos gateways. Em cenários de grande dinamismo e mobilidade (com conexões e desconexões de dispositivos acontecendo a todo momento), a descoberta e configuração de objetos deve ocorrer de forma contínua. Os protocolos de descoberta de serviços tradicional, como o Universal Plug and Play (UPnP) ou o Service Location Protocol (SLP), não foram desenvolvidos levando em consideração o alto dinamismo de ambientes IoT. Nesse sentido, introduzimos o processamento de eventos complexos (CEP), que é uma tecnologia para processamento em tempo real de fluxos de eventos heterogêneos, que permite a utilização de consultas em linguagem CQL (Continuous Query Language) para a busca de eventos de interesse. Em um modelo onde os eventos relacionados à descoberta de sensores são enviados para um fluxo CEP, consultas expressivas são escritas para que uma aplicação descubra continuamente serviços de interesse. Este trabalho apresenta a extensão do MHub/CDDL para o suporte à descoberta contínua de serviços em IoT, utilizando CEP. O MHub/CDDL (Mobile Hub / Context Data Distribution Layer) é um middleware para descoberta de serviços e gerenciamento de qualidade de contexto em IoT, desenvolvido numa parceria entre o Laboratory for Advanced Collaboration (LAC) da PUC-Rio e o Laboratório de Sistemas Distribuídos Inteligentes (LSDi) da Universidade Federal do Maranhão (UFMA). A implementação deste trabalho é feita para a plataforma Android (Java) e um estudo de caso no domínio de estacionamentos inteligentes é conduzido e implementado, elucidando o uso do mecanismo de descoberta contínuo.
The popularization of the Internet of Things sparked a growing opportunity for the creation of applications in various areas, by combining the use of sensors and/or actuators. In IoT environments, the role of elements called gateways is to provide an intermediate communication layer between IoT devices and cloud services. A crucial factor for the construction of large-scale applications is to allow the use of IoT devices in a transparent manner, in a service-oriented paradigm, where details of communication and configuration are handled by the gateways. In service model, applications must discover the high-level interfaces of the devices and do not have to deal with underlying details that are handled by gateways. In scenarios of high dynamism and mobility (with connections and disconnections of devices occuring all the time), this discovery and configuration must occur continuously. Traditional service discovery protocols, such as Universal Plug and Play (UPnP) or Service Location Protocol (SLP), have not been developed taking into consideration the high dinamicity of IoT environments. In this sense, we introduce complex event processing (CEP), which is a technology for real-time processing of heterogeneous event flows, which allows the use of CQL (Continuous Query Language for the search of events of interest. In a model where events related to sensor discovery are sent to a CEP flow, expressive queries are written for an application to continuously discover services of interest. This work presents the extension of MHub / CDDL to support continuous service discovery in IoT, using CEP. The MHub / CDDL (Mobile Hub / Context Data Distribution Layer) is a middleware for service discovery and quality context management in IoT, developed in a partnership between the Laboratory for Advanced Collaboration (LAC) from PUC-Rio and the Laboratório de Sistemas Distribuídos Inteligentes (LSDi) from Universidade Federal do Maranhão (UFMA). The implementation of this work is done in Android (Java) platform and a case study in the domain of smart parking is conducted and implemented, elucidating the use of the continuous discovery mechanism.
Miura, Taichi. "Self-discovery in Plato's 'Phaedo'." Thesis, King's College London (University of London), 2018. https://kclpure.kcl.ac.uk/portal/en/theses/selfdiscovery-in-platos-phaedo(afec867a-7f5c-4176-bd99-c98a99874923).html.
Full text