Dissertations / Theses on the topic 'Complete search'
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 'Complete search.'
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.
Ferreira, Junior Valnir, and N/A. "Improvements to Clause Weighting Local Search for Propositional Satisfiability." Griffith University. Institute for Integrated and Intelligent Systems, 2007. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20070823.123257.
Full textFerreira, Junior Valnir. "Improvements to Clause Weighting Local Search for Propositional Satisfiability." Thesis, Griffith University, 2007. http://hdl.handle.net/10072/365857.
Full textThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Institute for Integrated and Intelligent Systems
Full Text
McGowan, Robert. "A Search for Understanding Why Male, Long Term High School Dropouts Resist Returning to Complete a Secondary Credential." Thesis, University of Arkansas, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3702758.
Full textMuch of the resistance for returning to education seems to be related to the same reasons students left school to begin with. The reason for dropping out and resisting to return to school may be a result of too much emphasis on academic preparation and too little emphasis on satisfying the perceived needs for preparing a youth for adulthood. Four themes emerged from the field-note based interviews: (1) all students do not learn the same way, (2) there is a need for more participatory learning, (3) learning should be relevant to life as perceived by the student, and (4) there is a dislike of computer content that is not supported by personal instruction. While these themes are supportive of past research efforts and may not seem remarkable, the solutions offered by the participants to improve these problems are worthy of consideration, and may be of use to both secondary and adult education.
Cowhig, Patrick Carpenter. "A Complete & Practical Approach to Ensure the Legality of a Signal Transmitted by a Cognitive Radio." Thesis, Virginia Tech, 2006. http://hdl.handle.net/10919/34969.
Full textMaster of Science
Simões, Manuel Areias Sobrinho. "In search of the original leukemic clone in chronic myeloid leukemia patients in complete molecular remission after stem cell transplantation or imatinib." Doctoral thesis, Faculdade de Medicina da Universidade do Porto, 2010. http://hdl.handle.net/10216/56734.
Full textSimões, Manuel Areias Sobrinho. "In search of the original leukemic clone in chronic myeloid leukemia patients in complete molecular remission after stem cell transplantation or imatinib." Tese, Faculdade de Medicina da Universidade do Porto, 2010. http://hdl.handle.net/10216/56734.
Full textJurčík, Lukáš. "Evoluční algoritmy při řešení problému obchodního cestujícího." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2014. http://www.nusl.cz/ntk/nusl-224447.
Full textEyono, Obono Séraphin Désiré. "Recherche efficace d'images morphiques de mots." Rouen, 1995. http://www.theses.fr/1995ROUE5014.
Full textKopřiva, Jan. "Srovnání algoritmů při řešení problému obchodního cestujícího." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2009. http://www.nusl.cz/ntk/nusl-222126.
Full textArendt, Dustin Lockhart. "In Search of Self-Organization." Diss., Virginia Tech, 2012. http://hdl.handle.net/10919/26465.
Full textPh. D.
Rees, Leigh H. "Chirality : in search of organometallic second order non-linear optic materials." Thesis, University of Bristol, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.265324.
Full textAXENOVICH, Tatiana I., and Pavel M. BORODIN. "Search for Complex Disease Genes: Achievements and Failures." Research Institute of Environmental Medicine, Nagoya University, 2002. http://hdl.handle.net/2237/2772.
Full textHelleren, Caroline Anne. "A search for bridging-dinitrogen heterobimetallic complexes containing iron and molybdenum or tungsten." Thesis, University of Sussex, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.241719.
Full textFielden, D. J. "The role of Spt4/5 and the search for antitermination complexes in archaea." Thesis, University College London (University of London), 2014. http://discovery.ucl.ac.uk/1455740/.
Full textDuong, Thach-Thao Nguyen. "Improving Diversification in Local Search for Propositional Satisfiability." Thesis, Griffith University, 2014. http://hdl.handle.net/10072/365717.
Full textThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Information and Communication Technology
Science, Environment, Engineering and Technology
Full Text
Wåhlén, Herje. "Voice Assisted Visual Search." Thesis, Umeå universitet, Institutionen för informatik, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-38204.
Full textVoice-Assisted Visual Search
White, Bradley Michael. "Experimental Development of Automated Search Techniques for Discrete Combinatorial Optimisation." Thesis, Griffith University, 2009. http://hdl.handle.net/10072/365420.
Full textThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Griffith Business School
Griffith Business School
Full Text
Mason, Chris. "The search for low-valent transition metal complexes for oligomerization and polymerization of ethylene." Thesis, University of Ottawa (Canada), 2010. http://hdl.handle.net/10393/28515.
Full textDunbar, Alexander. "The search for submarine fan complexes in the Upper Cretaceous, Browse Basin, Northwest Shelf, Australia /." Adelaide, 2000. http://web4.library.adelaide.edu.au/theses/09SB/09sbd898.pdf.
Full textCombe, Caroline Jane. "Hepatic receptor(s) for serine protease-inhibitor complexes." Thesis, University of Aberdeen, 1995. http://digitool.abdn.ac.uk/R?func=search-advanced-go&find_code1=WSN&request1=AAIU549619.
Full textMatthews, Cameron. "Synthesis, crystal structures and molecular modelling of rare earth complexes with bis(2-pyridylmethyl)amine: aim topological analysis and ligand conformation search." Thesis, Nelson Mandela Metropolitan University, 2017. http://hdl.handle.net/10948/8230.
Full textMetay, Estelle. "Méthodologie d'accès à des benzolactones de taille moyenne." Paris 12, 2005. https://athena.u-pec.fr/primo-explore/search?query=any,exact,990002281830204611&vid=upec.
Full textMedium ring compounds are important in organic chemistry. They are contained in a large number of natural products. They are also intermediates in many synthetic applications. We have focused on the preparation of benzolactones. Lactones containing up to 6 members are easily prepared. Also, macrocyclic lactones larger than 12-membered rings can be efficiently obtained in high dilution reaction conditions. On the contrary, medium ring lactones, like other medium-size ring compounds, are reported to be the most difficult to prepare by cyclisation. Our purpose was to apply an efficient C,C bond forming electrochemical reaction, involving the nickel catalyzed arylation of activated olefins, to the formation of medium ring benzolactones. The first idea was to perform this reaction intramolecularily. In such a simple route, the activated olefin is first tethered to the aryl moiety before the electrochemical arylation of the C,C-double bond, thus leading to the expected fused benzolactone in only 2 steps. Unfortunately until now, this method is of low efficiency, as the main products in the electrochemical step come from reduction of the starting compound. As an alternative, we could first form the C,C-bond by a bimolecular process before closing the ring by lactonisation. This simple method to access rapidly to medium ring lactones using an electrochemical step is efficient. Benzolactones were obtained in good yield. To decrease the number of steps and notably avoid the protection/deprotection steps we found it quite convenient to first tethered the carboxylic group to the aromatic ring and then introduce an alkyl chain bearing the hydroxyl group precursor in the form of a carbonyl. Apart from reducing the number of steps, this enables access to chiral lactones. Other benzolactones have been prepared having notably a heteroaryl ring or a double bond in the lactone ring
Le, Gac Jean-Pierre. "Etude comparative des concepts de GYSI et de SEARS en prothèse complète." Brest, 1992. http://www.theses.fr/1992BRES4014.
Full textAltman, Michael Darren. "Computational ligand design and analysis in protein complexes using inverse methods, combinatorial search, and accurate solvation modeling." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/36258.
Full textVita.
Includes bibliographical references (p. 207-230).
This thesis presents the development and application of several computational techniques to aid in the design and analysis of small molecules and peptides that bind to protein targets. First, an inverse small-molecule design algorithm is presented that can explore the space of ligands compatible with binding to a target protein using fast combinatorial search methods. The inverse design method was applied to design inhibitors of HIV-1 protease that should be less likely to induce resistance mutations because they fit inside a consensus substrate envelope. Fifteen designed inhibitors were chemically synthesized, and four of the tightest binding compounds to the wild-type protease exhibited broad specificity against a panel of drug resistance mutant proteases in experimental tests. Inverse protein design methods and charge optimization were also applied to improve the binding affinity of a substrate peptide for an inactivated mutant of HIV-1 protease, in an effort to learn more about the thermodynamics and mechanisms of peptide binding. A single mutant peptide calculated to have improved binding electrostatics exhibited greater than 10-fold improved affinity experimentally.
(cont.) The second half of this thesis presents an accurate method for evaluating the electrostatic component of solvation and binding in molecular systems, based on curved boundary-element method solutions of the linearized Poisson-Boltzmann equation. Using the presented FFTSVD matrix compression algorithm and other techniques, a full linearized Poisson-Boltzmann equation solver is described that is capable of solving multi-region problems in molecular continuum electrostatics to high precision.
Michael Darren Altman.
Ph.D.
Moraes, Maurício Coutinho. "Towards completely automatized HTML form discovery on the web." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2013. http://hdl.handle.net/10183/70194.
Full textBouvet, Diane. "Études structurales de la stabilité en solution de complexes de platine anticancéreux." Paris 12, 2003. https://athena.u-pec.fr/primo-explore/search?query=any,exact,990002110950204611&vid=upec.
Full textThree platinum complexes are curently used in chemotherapy in France. These drugs seem to react rapidly with nucleophilic species in solution. Their degradation has two consequences: in vitro, it can compromise the stability of the drug in solution before administration; in vivo, the structural modificatjon of these molecules can induce notable changes in their modes of action. Due to the non-crystalline properties of the degradation products of carboplatin and oxaliplatin in solution, the structural characterization must be done with X Ray Absorption Spectroscopy (EXAFS). In most cases, this technique allowed us to characterize the degradation products of the platinum drugs in solution, in presence of nucleophilic species
Zalaket, Joseph. "Planification dans des strucures complexes." Toulouse 3, 2004. http://www.theses.fr/2004TOU30188.
Full textAI planning is an essential element to give to an autonomous agent the possibility of reasoning on the way of achieving a goal. Several assumptions have been added to the modeling of planning problems facilitating the task of planning on certain domains of benchmark. However these assumptions shifted the application of planning on real world domains. Several works was made to release one or the other of these assumptions. In this work of thesis I propose the relieving of the assumption which imposes that the set of states in the space is finite and that by allowing the planning of numerical knowledge, which can induce with the generation of new objects in the world. I propose planning in a world described in an Object-Oriented aspect. In this aspect the functions are used to represent the relations between the objects and to define the effects of the actions. Thus, I propose a functional approach in which the numerical data can be updated by application of functions
Amatore, Muriel. "Synthèse de liaisons carbone-carbone via l'utilisation d'une catalyse par des complexes du cobalt." Paris 12, 2006. https://athena.u-pec.fr/primo-explore/search?query=any,exact,990002520930204611&vid=upec.
Full textThis work is devoted to the realization of direct chemical cross-coupling reactions, using cobalt (II) salts associated to 2,2'-bipyridine or triphenylphosphine. These reactions involve aromatic or heteroamromatic halides or pseudo-halides, as well as a broad range of reagents such as vinylic acetates, activated olefins or alkyl halides. All these cross-coupling reactions are based on the formation, in catalytic amounts, of organometallic derivatives, the aryl-cobalt species. These catalytic intermediates allow us to direct the reactions either mainly towards carbon-carbon bond formation or towards the synthesis of arylzinc reagents, that we obtained in good yields strating from the corresponding aromatic chlorides. This manuscript, divided into four chapters, presents the results we obtained during this research work. The use of various catalytic systems such as COBR2(BPY) or COBR2(PPH3) in association with manganese as reductant, or else COBR2(BPY) or COBR2 in association with zinc powder, allowed us to develop vinylation reactions (chapter I), conjugate addition reactions (chapter II), alkylation reactions via an organozinc reagent or not (chapter III) and lastly, non symetric biaryls synthesis (chapter IV)
Marie, Benjamin. "Exploitation d’informations riches pour guider la traduction automatique statistique." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS066/document.
Full textAlthough communication between languages has without question been made easier thanks to Machine Translation (MT), especially given the recent advances in statistical MT systems, the quality of the translations produced by MT systems is still well below the translation quality that can be obtained through human translation. This gap is partly due to the way in which statistical MT systems operate; the types of models that can be used are limited because of the need to construct and evaluate a great number of partial hypotheses to produce a complete translation hypothesis. While more “complex” models learnt from richer information do exist, in practice, their integration into the system is not always possible, would necessitate a complete hypothesis to be computed or would be too computationally expensive. Such features are therefore typically used in a reranking step applied to the list of the best complete hypotheses produced by the MT system.Using these features in a reranking framework does often provide a better modelization of certain aspects of the translation. However, this approach is inherently limited: reranked hypothesis lists represent only a small portion of the decoder's search space, tend to contain hypotheses that vary little between each other and which were obtained with features that may be very different from the complex features to be used during reranking.In this work, we put forward the hypothesis that such translation hypothesis lists are poorly adapted for exploiting the full potential of complex features. The aim of this thesis is to establish new and better methods of exploiting such features to improve translations produced by statistical MT systems.Our first contribution is a rewriting system guided by complex features. Sequences of rewriting operations, applied to hypotheses obtained by a reranking framework that uses the same features, allow us to obtain a substantial improvement in translation quality.The originality of our second contribution lies in the construction of hypothesis lists with a multi-pass decoding that exploits information derived from the evaluation of previously translated hypotheses, using a set of complex features. Our system is therefore capable of producing more diverse hypothesis lists, which are globally of a better quality and which are better adapted to a reranking step with complex features. What is more, our forementioned rewriting system enables us to further improve the hypotheses produced with our multi-pass decoding approach.Our third contribution is based on the simulation of an ideal information type, designed to perfectly identify the correct fragments of a translation hypothesis. This perfect information gives us an indication of the best attainable performance with the systems described in our first two contributions, in the case where the complex features are able to modelize the translation perfectly. Through this approach, we also introduce a novel form of interactive translation, coined "pre-post-editing", under a very simplified form: a statistical MT system produces its best translation hypothesis, then a human indicates which fragments of the hypothesis are correct, and this new information is then used during a new decoding pass to find a new best translation
Galant, Céline. "Nouveaux complexes polyélectrolytes impliquant un polymère de ß-cyclodextrine, un tensioactif cationique et un polyanion." Paris 12, 2003. https://athena.u-pec.fr/primo-explore/search?query=any,exact,990002111230204611&vid=upec.
Full textA new model of polyelectrolyte compiex has been elaborated, based on inclusion complexes between a neutral polyrner of β -CD and a cationic surfactant (DTAC). And complexes of opposite charges between DTAC and a polyanion. Inclusion interactions between poly(β-CD) and DTAC alone in solution have first been characterized with several techniques including conductimetric and fluorimetric measurements and surface tension measurements. Structure of the resulting aggregates has been studied by viscosimetry and SANS as a function of the ionic strength and stoechiometry of the mixture. Then, the addition of a polyanion to the poly(β-CD)/DTAC mixture has been shown to form water soluble ternary complexes. For three polyanions of different natures and architectures NaPSS, NaDxS and DNA), the structural properties of the complexes have been analyzed by SANS, viscosimetry and DLS as a function of the DTAC concentration. Stability and reversibility of the complexes have also been studied by varying the ionic strength of the medium and the concentration in competitors
Vincent, Fanny. "Interactions protéine-protéine au cours de l'étirement des cardiomyocytes : mise en évidence d'une interaction entre la calcineurine et la PKC ε." Paris 12, 2005. https://athena.u-pec.fr/primo-explore/search?query=any,exact,990002323710204611&vid=upec.
Full textMyocardial stretch activates a number of pathways including the Protein kinase C (PKC) that in turn activates mitogen-activated protein kinases (MAPK), leading to gene expression stimulation and ventricular hypertrophy. The major finding of this study is the evidence in neonatal rat cardiomyocytes, of a dual level of interaction between calcineurin and PKCε, both being involved in stretch-induced ERK and JNK activations. In a first level, stretch induced a Calcineurin-dependent translocation of PKCε from cytosol to particulate fractions. The second level of interaction is a novel protein-protein complex formation induced by stretch where both PKCε and Calcineurin co-localized at the level of the perinuclear membrane as shown by immunofluorescent studies. Therapeutic agents designed to effectively promote or disrupt complex formation involved in pathological phenotype would likely achieve a level of specificity and efficacy not possible with present srategies
Tran, Công Tâm. "Simulations de fluides complexes à l'échelle mésoscopique sur GPU." Thesis, Limoges, 2018. http://www.theses.fr/2018LIMO0024/document.
Full textColloïdal suspensions have been studied by means of numerical simulation, using two physical models : Brownian dynamics and Stochastic Rotation Dynamics - Molecular Dynamics. These studies consist in parallizing colloïdal simulations from previous studies on GPU, and find some new optimisations for these specific simulations. An improvement of the neigborhood search has been implemented in all our BD type simulations. A SRD-MD with force coupling have been implemented for the first time in the literature, using a new decomposition scheme, which improves significantly its performances. Then, theses simulations have been adapted to study more complex colloidal suspensions : an interfacial heteroaggregation of colloidal suspensions, a heteroaggregation between two types of particles with a large size ratio, and outside this context, a nanoalloy simulation. Finally, the SRD model has been adapted to realistic fluid animtion from computer science context. Theses adaptations require to add to SRD model, the notion of compressibility and surface tension. First results have been released, like a pouring water into a glass simulation
Morice, Élise. "Études comportementales des souris invalidées pour le transporteur de la dopamine utilisées comme modèle d'analyse génétique de traits complexes." Paris 12, 2004. https://athena.u-pec.fr/primo-explore/search?query=any,exact,990003943180204611&vid=upec.
Full textDuring my thesis, I have carried out a behavioural analysis using the dopamine transporter (DAT) knockout mice. The DAT is responsible for the rapid uptake of dopamine into presynaptic terminals. We showed that changing the genetic background revealed the extent of phenotypic variation associated with the DAT mutation both at the physiological (survival, growth rate, lactation) and behavioural levels (spontaneous activity, maternal behaviour, sensitivity to psychostimulants). The data emphasised the key role of the dopaminergic transmission in the development of the behavioural lateralization, in behavioural flexibility, and as well as in associative learning and memory. The understanding of the contribution of the dopaminergic system to each of theses endophenotypes will allow us to make progress in psychiatric research
Ayadim, Abderrahime. "Structure et thermodynamique des suspensions colloïdales en phase volumique et confinée par la théorie des mélanges binaires." Paris 12, 2005. https://athena.u-pec.fr/primo-explore/search?query=any,exact,990002513970204611&vid=upec.
Full textThe Ornstein-Zernike integral equations are used to study the structure and the thermodynamics of colloidal suspensions modelled as a highly asymmetric solute-solvent mixture. We propose a new closure to remedy the non-convergence problem of the RHNC closure. After having tested it on the radial distribution functions, we determine the fluid-fluid coexistence line of asymmetric binary hard spheres with diameter ration R=10. We thus confirm from the phase diagram the validity of the effective one-component approach. Then, we examine these sytems in inhomogeneous phase (colloids near a wall or in a slit pore) and include attractions between the various components. The RHNC closure is tested then at the level of the structure and the potential of mean force. The method is finally used to study solvation effects of confined colloids
Amri, Anis. "Autour de quelques statistiques sur les arbres binaires de recherche et sur les automates déterministes." Thesis, Université de Lorraine, 2018. http://www.theses.fr/2018LORR0301.
Full textThis Phd thesis is divided into two independent parts. In the first part, we provide an asymptotic analysis of some statistics on the binary search tree. In the second part, we study the coupon collector problem with a constraint. In the first part, following the model introduced by Aguech, Lasmar and Mahmoud [Probab. Engrg. Inform. Sci. 21 (2007) 133—141], the weighted depth of a node in a labelled rooted tree is the sum of all labels on the path connecting the node to the root. We analyze the following statistics : the weighted depths of nodes with given labels, the last inserted node, nodes ordered as visited by the depth first search procees, the weighted path length, the weighted Wiener index and the weighted depths of nodes with at most one child in a random binary search tree. In the second part, we study the asymptotic shape of the completion curve of the collection conditioned to T_n≤ (1+Λ), Λ>0, where T_n≃n lnn is the time needed to complete accessible automata, we provide a new derivation of a formula due to Korsunov [Kor78, Kor86]
Serrà, Julià Joan. "Identification of versions of the same musical composition by processing audio descriptions." Doctoral thesis, Universitat Pompeu Fabra, 2011. http://hdl.handle.net/10803/22674.
Full textAquest treball es centra en la identificació automàtica de versions musicals (interpretacions alternatives d'una mateixa composició: 'covers', directes, remixos, etc.). En concret, proposem dos tiupus d'estratègies: la lliure de model i la basada en models. També introduïm tècniques de post-processat per tal de millorar la identificació de versions. Per fer tot això emprem conceptes relacionats amb l'anàlisi no linial de senyals, xarxes complexes i models de sèries temporals. En general, el nostre treball porta la identificació automàtica de versions a un estadi sense precedents on s'obtenen bons resultats i, al mateix temps, explora noves direccions de futur. Malgrat que els passos que seguim estan guiats per la natura dels senyals involucrats (enregistraments musicals) i les característiques de la tasca que volem solucionar (identificació de versions), creiem que la nostra metodologia es pot transferir fàcilment a altres àmbits i contextos.
Lorett, Velasquez Vaneza Paola Verfasser], Matthias [Akademischer Betreuer] Westerhausen, and Alexander [Akademischer Betreuer] [Schiller. "Synthesis of ruthenium and manganese carbonyl complexes : a search for new carbon monoxide releasing molecules (CORMs) / Vaneza Paola Lorett Velasquez. Gutachter: Matthias Westerhausen ; Alexander Schiller." Jena : Thüringer Universitäts- und Landesbibliothek Jena, 2014. http://d-nb.info/104709696X/34.
Full textZhou, Yi. "Optimization Algorithms for Clique Problems." Thesis, Angers, 2017. http://www.theses.fr/2017ANGE0013/document.
Full textThis thesis considers four clique problems: the maximum vertex weight clique problem (MVWCP), the maximum s-plex problem (MsPlex), the maximum balanced biclique problem (MBBP) and the clique partitioning problem (CPP). The first three are generalization and relaxation of the classic maximum clique problem (MCP), while the last problem belongs to a clique grouping problem. These combinatorial problems have numerous practical applications. Given that they all belong to the NP-Hard family, it is computationally difficult to solve them in the general case. For this reason, this thesis is devoted to develop effective algorithms to tackle these challenging problems. Specifically, we propose two restart tabu search algorithms based on a generalized PUSH operator for MVWCP, a frequency driven local search algorithms for MsPlex, a graph reduction based tabu search as well as effective exact branch and bound algorithms for MBBP and lastly, a three phase local search algorithm for CPP. In addition to the design of efficient move operators for local search algorithms, we also integrate components like graph reduction or upper bound propagation in order to deal deal with very large real-life networks. The experimental tests on a wide range of instances show that our algorithms compete favorably with the main state-of-the-art algorithms
Del, Val Noguera Elena. "Semantic Service management for service-oriented MAS." Doctoral thesis, Universitat Politècnica de València, 2013. http://hdl.handle.net/10251/27556.
Full textDel Val Noguera, E. (2013). Semantic Service management for service-oriented MAS [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/27556
Palancia
Åberg, Johan. "Open Quantum Systems : Effects in Interferometry, Quantum Computation, and Adiabatic Evolution." Doctoral thesis, Uppsala University, Quantum Chemistry, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-5893.
Full textThe effects of open system evolution on single particle interferometry, quantum computation, and the adiabatic approximation are investigated.
Single particle interferometry: Three concepts concerning completely positive maps (CPMs) and trace preserving CPMs (channels), named subspace preserving (SP) CPMs, subspace local channels, and gluing of CPMs, are introduced. SP channels preserve probability weights on given orthogonal sum decompositions of the Hilbert space of a quantum system. Subspace locality determines what channels act locally with respect to such decompositions. Gluings are the possible total channels obtainable if two evolution devices, characterized by channels, act jointly on a superposition of a particle in their inputs. It is shown that gluings are not uniquely determined by the two channels. We determine all possible interference patterns in single particle interferometry for given channels acting in the interferometer paths. It is shown that the standard interferometric setup cannot distinguish all gluings, but a generalized setup can.
Quantum computing: The robustness of local and global adiabatic quantum search subject to decoherence in the instantaneous eigenbasis of the search Hamiltonian, is examined. In both the global and local search case the asymptotic time-complexity of the ideal closed case is preserved, as long as the Hamiltonian dynamics is present. In the case of pure decoherence, where the environment monitors the search Hamiltonian, it is shown that the local adiabatic quantum search performs as the classical search with scaling N, and that the global search scales like N3/2 , where N is the list length. We consider success probabilities p<1 and prove bounds on the run-time with the same scaling as in the conditions for the p → 1 limit.
Adiabatic evolution: We generalize the adiabatic approximation to the case of open quantum systems in the joint limit of slow change and weak open system disturbances.
Unsworth, David I. "Individual differences in complex memory span and episodic retrieval examining the dynamics of delayed and continuous distractor free recall / by David I. Unsworth." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/10463.
Full textRuiz, Echartea Maria Elisa. "Pairwise and Multi-Component Protein-Protein Docking Using Exhaustive Branch-and-Bound Tri-Dimensional Rotational Searches." Electronic Thesis or Diss., Université de Lorraine, 2019. http://www.theses.fr/2019LORR0306.
Full textDetermination of tri-dimensional (3D) structures of protein complexes is crucial to increase research advances on biological processes that help, for instance, to understand the development of diseases and their possible prevention or treatment. The difficulties and high costs of experimental methods to determine protein 3D structures and the importance of protein complexes for research have encouraged the use of computer science for developing tools to help filling this gap, such as protein docking algorithms. The protein docking problem has been studied for over 40 years. However, developing accurate and efficient protein docking algorithms remains a challenging problem due to the size of the search space, the approximate nature of the scoring functions used, and often the inherent flexibility of the protein structures to be docked. This thesis presents an algorithm to rigidly dock proteins using a series of exhaustive 3D branch-and-bound rotational searches in which non-clashing orientations are scored using ATTRACT. The rotational space is represented as a quaternion “π-ball”, which is systematically sub-divided in a “branch-and-bound” manner, allowing efficient pruning of rotations that will give steric clashes. The contribution of this thesis can be described in three main parts as follows. 1) The algorithm called EROS-DOCK to assemble two proteins. It was tested on 173 Docking Benchmark complexes. According to the CAPRI quality criteria, EROS-DOCK typically gives more acceptable or medium quality solutions than ATTRACT and ZDOCK. 2)The extension of the EROS-DOCK algorithm to allow the use of atom-atom or residue-residue distance restraints. The results show that using even just one residue-residue restraint in each interaction interface is sufficient to increase the number of cases with acceptable solutions within the top-10 from 51 to 121 out of 173 pairwise docking cases. Hence, EROS-DOCK offers a new improved search strategy to incorporate experimental data, of which a proof-of-principle using data-driven computational restraints is demonstrated in this thesis, and this might be especially important for multi-body complexes. 3)The extension of the algorithm to dock trimeric complexes. Here, the proposed method is based on the premise that all of the interfaces in a multi-body docking solution should be similar to at least one interface in each of the lists of pairwise docking solutions. The algorithm was tested on a home-made benchmark of 11 three-body cases. Seven complexes obtained at least one acceptable quality solution in the top-50. In future, the EROS-DOCK algorithm can evolve by integrating improved scoring functions and other types of restraints. Moreover, it can be used as a component in elaborate workflows to efficiently solve complex problems of multi-protein assemblies
Mora, Campos Armando. "Estudio de Arquitecturas VLSI de la etapa de predicción de la compensación de movimiento, para compresión de imágenes y video con Algoritmos full-search. Aplicación al estándar H.264/AVC." Doctoral thesis, Universitat Politècnica de València, 2008. http://hdl.handle.net/10251/3446.
Full textMora Campos, A. (2008). Estudio de Arquitecturas VLSI de la etapa de predicción de la compensación de movimiento, para compresión de imágenes y video con Algoritmos full-search. Aplicación al estándar H.264/AVC [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/3446
Palancia
Nguyen, Khac Duy. "Structural damage identification using experimental modal parameters via correlation approach." Thesis, Queensland University of Technology, 2018. https://eprints.qut.edu.au/117289/2/Khac%20Duy%20Nguyen.pdf.
Full textJacomini, Ricardo de Souza. "Inferência de redes gênicas por agrupamento, busca exaustiva e análise de predição intrinsecamente multivariada." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-05092017-111639/.
Full textGene network (GN) inference from temporal gene expression data is a crucial and challenging problem in Systems Biology. Expression datasets usually consist of dozens of temporal samples, while networks consist of thousands of genes, thus rendering many inference methods unfeasible in practice. To improve the scalability of GN inference methods, this work proposes a framework called GeNICE, based on Probabilistic Gene Networks; the main novelty is the introduction of a clustering procedure to group genes with related expression profiles, to provide an approximate solution with reduced computational complexity. The defined clusters were used to perform an exhaustive search to retrieve the best predictor gene subsets for each target gene, according to multivariate criterion functions. GeNICE greatly reduces the search space because predictor candidates are restricted to one representative gene per cluster. Finally, a multivariate analysis is performed for each defined predictor subset to retrieve minimal subsets and to simplify the network. In experiments with in silico generated datasets, GeNICE achieved substantial computational time reduction when compared to an existing solution without the clustering step, while preserving the gene expression prediction accuracy even when the number of clusters is small (about fifty) relative to the number of genes (order of thousands). For a Plasmodium falciparum microarray dataset, the prediction accuracy achieved by GeNICE was roughly 97% on average. The inferred networks for the apicoplast and glycolytic target genes reflects the topological properties of \"small-world\"and \"scale-free\"complex network models in which a large part of the connections is established between genes of the same functional module (smallworld networks) and the degree distribution of the connections between genes tends to form a power law, in which most genes present few connections and few genes (hubs) present a large number of connections (scale-free networks), as expected.
Mamani, Alexander Victor Ocsa. "Soluções aproximadas para algoritmos escaláveis de mineração de dados em domínios de dados complexos usando GPGPU." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-22112011-132339/.
Full textThe increasing availability of data in diverse domains has created a necessity to develop techniques and methods to discover knowledge from huge volumes of complex data, motivating many research works in databases, data mining and information retrieval communities. Recent studies have suggested that searching in complex data is an interesting research field because many data mining tasks such as classification, clustering and motif discovery depend on nearest neighbor search algorithms. Thus, many deterministic approaches have been proposed to solve the nearest neighbor search problem in complex domains, aiming to reduce the effects of the well-known curse of dimensionality. On the other hand, probabilistic algorithms have been slightly explored. Recently, new techniques aim to reduce the computational cost relaxing the quality of the query results. Moreover, in large-scale problems, an approximate solution with a solid theoretical analysis seems to be more appropriate than an exact solution with a weak theoretical model. On the other hand, even though several exact and approximate solutions have been proposed, single CPU architectures impose limits on performance to deliver these kinds of solution. An approach to improve the runtime of data mining and information retrieval techniques by an order-of-magnitude is to employ emerging many-core architectures such as CUDA-enabled GPUs. In this work we present a massively parallel kNN query algorithm based on hashing and CUDA implementation. Our method, based on the LSH scheme, is an approximate method which queries high-dimensional datasets with sub-linear computational time. By using the massively parallel implementation we improve data mining tasks, specifically we create solutions for (soft) realtime time series motif discovery. Experimental studies on large real and synthetic datasets were carried out thanks to the highly CUDA parallel implementation. Our performance evaluation on GeForce GTX 470 GPU resulted in average runtime speedups of up to 7x on the state-of-art of similarity search and motif discovery solutions
Lima, Danielli Araújo. "Autômatos celulares e sistemas bio-inspirados aplicados ao controle inteligente de robôs." Universidade Federal de Uberlândia, 2017. http://dx.doi.org/10.14393/ufu.te.2018.26.
Full textEm diversas situações, o volume de tarefas a serem cumpridas não pode ser realizado por um único robô. Assim, um campo que tem despertado crescente interesse é a investigação do comportamento de enxame de robôs de busca. Estratégias de cooperação e controle desse enxame devem ser consideradas para um desempenho eficiente do time de robôs. Existem várias técnicas clássicas em inteligência artificial que são capazes de resolver este problema. Neste trabalho um conjunto de técnicas bio-inspiradas, que engloba um modelo baseado em autômatos celulares com memória e feromônio invertido, foi considerado inicialmente para coordenar um time de robôs na tarefa de forrageamento para ambientes previamente conhecidos. Os robôs do time compartilham o mesmo ambiente, comunicando-se através do feromônio invertido, que é depositado por todos os agentes a cada passo de tempo, resultando em forças de repulsão e maior cobertura do ambiente. Por outro lado, o processo de retorno para o ninho é baseado no comportamento social observado no processo de evacuação de pedestres, resultando em forças de atração. Todos os movimentos deste processo são de primeira escolha e a resolução de conflitos proporciona uma característica não-determinista ao modelo. Posteriormente, o modelo base foi adaptado para a aplicação nas tarefas de coleta seletiva e busca e resgate. Os resultados das simulações foram apresentados em diferentes condições de ambiente. Além disso, parâmetros como quantidade e disposição da comida, posição dos ninhos e largura, constantes relacionadas ao feromônio, e tamanho da memória foram analisados nos experimentos. Em seguida, o modelo base proposto neste trabalho para tarefa de forrageamento, foi implementado usando os robôs e-Puck no ambiente de simulação Webots, com as devidas adaptações. Por fim, uma análise teórica do modelo investigado foi analisado através da teoria dos grafos e das filas. O método proposto neste trabalho mostrou-se eficiente e passível de ser implementado num alto nível de paralelismo e distribuição. Assim, o modelo torna-se interessante para a aplicação em outras tarefas robóticas, especialmente em problemas que envolvam busca multi-objetiva paralela.
In several situations, the volume of tasks to be accomplished can not be performed by a single robot. Thus, a field that has attracted growing interest is the behavior investigation of the search swarm robots. Cooperation and control strategies of this swarm should be considered for an efficient performance of the robot team. There are several classic techniques in artificial intelligence that are able to solve this problem. In this work a set of bio-inspired techniques, which includes a model based on cellular automata with memory and inverted pheromone, was initially considered to coordinate a team of robots in the task of foraging to previously known environments. The team's robots share the same environment, communicating through the inverted pheromone, which is deposited by all agents at each step of time, resulting in repulsive forces and increasing environmental coverage. On the other hand, the return process to the nest is based on the social behavior observed in the process of pedestrian evacuation, resulting in forces of attraction. All movements in this process are first choice and conflict resolution provides a non-deterministic characteristic to the model. Subsequently, the base model was adapted for the application in the tasks of selective collection and search and rescue. The results of the simulations were presented under different environment conditions. In addition, parameters such as amount and arrangement of food, nest position and width, pheromone-related constants, and memory size were analyzed in the experiments. Then, the base model proposed in this work for foraging task, was implemented using the e-Puck robots in the simulation environment Webots, with the appropriate adaptations. Finally, a theoretical analysis of the investigated model was analyzed through the graphs and queuing theory. The method proposed in this work proved to be efficient and capable of being implemented at a high level of parallelism and distribution. Thus, the model becomes interesting for the application in other robotic tasks, especially in problems that involve parallel multi-objective search.
Tese (Doutorado)
Randau, Emma, and Frida Tordsson. "Är detaljhandlarna fast i det förflutna? : En fallstudie av IKEAs köksavdelning." Thesis, Högskolan i Borås, Akademin för textil, teknik och ekonomi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-23980.
Full textConsumer behaviour has changed, today consumers do not solely search for information in the physical store prior to a complex purchase. Technological development and online stores have enabled consumers to search for information whenever and wherever they want. This has led to consumers being more informed than ever. The change and development of consumer behaviour is an important research subject, as companies must understand their consumers in order to create the best business strategies and business models possible. Therefore, is the aim of this thesis to gain a deeper understanding of this changed consumer behaviour and if the physical store might have a different role during consumer preparation prior to a complex purchase.The design used was a case study of IKEA’s kitchen department. Our intention was to understand important aspects of consumer preparation, information search and behaviour prior to a complex purchase. Therefore, was a mixed method strategy was used, which allowed us to understand if the role of the physical store has changed during consumer preparation prior to a complex purchase. This was studied through observations, questionnaire and interviews. Due to the usage of eye-tracking technology during the observation, we could study the respondent’s behaviour more in detail than previous research has done. The conclusion of the study is that the physical store still has an important role when consumers purchase complex products. Foremost, due to consumers’ having a great need to touch and feel the product, and to gain the whole picture of what they intend to purchase. Therefore, was the main conclusion that the role of the physical store prior to a complex purchase is to complement the information available online, by enabling consumers to interact with the products in a real world environment.
Мінакова, О. О. "Економічне планування та прогнозування розвитку харчової промисловості України." Thesis, Одесса, 2019. http://ir.stu.cn.ua/123456789/17631.
Full textДисертація присвячена систематизації теоретичних засад та обґрунтуванню практичних рекомендацій щодо розвитку сучасних напрямів економічного планування і прогнозування розвитку харчової промисловості України. Обґрунтовано трактування сутності економічної категорії «планування» як складової процесу прийняття управлінських рішень, спрямованих на забезпечення координованості та узгодженості дій зацікавлених суб’єктів з огляду на параметри економічних процесів на рівні держави, регіону, галузі або підприємства, що дозволить забезпечити необхідні пропорції в розвитку харчової промисловості відповідно до встановлених цілей. Визначено спільне та відмінності планування та прогнозування в економіці за ознаками масштабу, об’єктів, призначенням, цілями, конкретною установкою. Розвинуто науково-методичний підхід до планування розвитку галузі, який базується на комплексному аналізі досвіду використання методів соціально-економічного прогнозування та планування в провідних країнах світу й надають змогу обґрунтувати перспективні напрями розвитку галузі. На підставі узагальнення практики організації та функціонування харчової промисловості, обґрунтовано необхідність створення інтегрованих структур, які носять багатопрофільний характер їх розвитку від простих до складних формувань, в яких беруть участь декілька підприємств. Розроблено методику нормативного прогнозування розвитку харчової галузі на основі індикативного планування та формальних методів соціально-економічної статистики та модель добової енергетичної цінності на основі множинної регресії.
Диссертация посвящена систематизации теоретических основ и обосновании практических рекомендаций по развитию направлений экономического планирования и прогнозирования развития пищевой промышленности Украины. Обоснована трактовка сущности экономической категории «планирование» как составляющей процесса принятия управленческих решений, направленных на обеспечение скоординированности и согласованности действий заинтересованных сторон, учитывая параметры экономических процессов на уровне государства, региона, отрасли или предприятия, что позволит обеспечить необходимые пропорции в развитии пищевой промышленности в соответствии с установленными целями. Определены общие черты и различия при планировании и прогнозировании в экономике по признакам масштаба, объектов, назначения, целям, конкретной установке. Предложен научно-методический подход к планированию развития отрасли, основанный на комплексном анализе опыта использования методов социально-экономического прогнозирования и планирования в ведущих странах мира и даёт возможность обосновать перспективные направления развития отрасли. На основании обобщения практики организации и функционирования пищевой промышленности, обоснована необходимость создания интегрированных структур, которые носят многопрофильный характер от простых к сложным формированиям, в которых принимают участие несколько предприятий. Разработана методика нормативного прогнозирования развития пищевой отрасли на основе индикативного планирования и формальных методов социально-экономической статистики и модель суточной энергетической ценности на основе множественной регрессии. При реформировании структуры и экономического механизма управления пищевой промышленностью, в работе получило дальнейшего развития исследование проблемы обеспечения населения основными видами продуктов питания на основе разработки множественной регрессионной зависимости суточной энергетической ценности на 1 человека от потребления основных продуктов питания в разрезе регионов Украины. Полученная модель позволила исследовать региональную структуру потребления продуктов животного и растительного происхождения и определить регионы со значительным отклонением от рекомендованных значений. Обоснованы приоритетные направления государственного управления на основе прогнозных моделей, которые исходили из необходимости совершенствования методики определения емкости внутреннего рынка пищевых продуктов и планирования доходов отрасли. В основе указанных расчетов положены перспективное прогнозирование экономического роста государства и доходов населения на основе трехлетнего бюджетного планирования, численности населения по демографическим методам.
The dissertation is devoted to the systematization of theoretical principles and the substantiation of practical recommendations for the development of modern areas of economic planning and forecasting of the food industry development in Ukraine. The essence of the economic category of "planning" is substantiated. The common and differences of planning and forecasting in economy are determined on the basis of scale, objects, purpose, goals, specific installation. The scientific and methodical approach to planning of the industry development is developed, which is based on a comprehensive analysis of the experience of using socio-economic forecasting and planning methods in the leading countries of the world and provides an opportunity to substantiate the perspective directions of the industry's development. Based on the generalization of the food industry organization practice, the necessity of creating integrated structures that have a multiprofile nature of their development from simple to complex formations, which involves several enterprises, is substantiated. The method of normative forecasting of food industry development on the basis of indicative planning and formal methods of socio-economic statistics and model of daily energy value on the basis of multiple regression is developed. The scientific and methodical approach to the planning of the industry development is improved, which is based on a comprehensive analysis of the experience of using socio-economic forecasting and planning methods in the leading countries of the world.
Кравчук, Володимир Вікторович. "Комплекс програм для визначення нероздільних завадостійких кодів." Bachelor's thesis, КПІ ім. Ігоря Сікорського, 2020. https://ela.kpi.ua/handle/123456789/35023.
Full textThe bachelors project includes an explanatory note (97 pages, 41 drawings, 7 annexes). In this work, the topics of error correction and error detection coding, finding maximal clique of graph have been researched. Different types of coding were considered, the problem of analytic speed of code was described and Bron-Kerbosh algorithm was analyzed. Based on specifics of equivalents codes and Hamming graph the methods of algorithm optimization for finding maximal undivided error correcting code were suggested. It has been decided to develop a complex of program which will help to calculate and research error correcting codes. The concrete requirements and functionality for the complex were formulated: possibility to search maximal undivided error correcting code according to parameters provided by user, stop work of complex in the moment with saving intermediate data algorithm are working with, loading the saved data and continue work after algorithm had been stopped, the possibility to perform some operations with codes like compute the minimal code distance, compute minimal code distance between a word and a code, sort code, provide simple and understandable graphical user interface for comfortable working with program. The complex of programs is implemented by Java programming language which is supported by all the most popular operation systems using native library JavaFX for developing graphical user interface.