To see the other types of publications on this topic, follow the link: Methyl branched.

Dissertations / Theses on the topic 'Methyl branched'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Methyl branched.'

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

Houseman, Jonathan. "Branched chains in poly(methyl methacrylate) polymerisations incorporating a polymeric chain transfer agent." Thesis, Loughborough University, 2000. https://dspace.lboro.ac.uk/2134/34854.

Full text
Abstract:
Branching in poly(methyl methacrylate) (PMMA) is produced by incorporating a pre-prepared polymeric chain transfer agent (PCTA) into a single stage radical polymerisation. Samples of PCTA having a range of transfer functionalities and molar masses were synthesised by modifying a methacrylate-based copolymer. Control of branching in PMMA has been studied as a function of transfer functionality and molar mass in the PCT A and a function of MMA and initiator concentrations in the MMA polymerisation. The branched samples of PMMA have been characterised by size exclusion chromatography (SEC) with m
APA, Harvard, Vancouver, ISO, and other styles
2

Hauff, Simone [Verfasser]. "Methyl-Branched Fatty Acids and Chiral Anteiso-Fatty Acids in Neutral and Polar Lipids of Biological Samples / Simone Hauff." Aachen : Shaker, 2010. http://d-nb.info/108188570X/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Batista, Marine. "Self-assembly of Fatty Acids of Hair at the water-air interface." Thesis, KTH, Materialvetenskap, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-277915.

Full text
Abstract:
18-methyl eicosanoic acid (18-MEA), which is a branched fatty acid, is found at the outermost surface of mammalian hair with other straight-chain fatty acids such as palmitic acid and stearic acid. However, the precise role of 18-MEA is not yet completely understood. 18-MEA on Cadmium chloride subphase forms curvature at the water/air interface, leading to the formation of 3D-domains that can be easily transferred into solid support allowing to create complex and multi-functional structures. This project investigates if a non-toxic subphase would also lead to the formation of 3D-domains or if
APA, Harvard, Vancouver, ISO, and other styles
4

Nair, Asha V. "Molecular basis of polyketide β-methyl branch formation". Thesis, University of Bristol, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.629354.

Full text
Abstract:
Type I modular polyketide synthases (PKSs) are giant multi-functional enzymes that catalyse the assembly of a range of bioactive natural products. The bacillaene synthase (PksX) from Bacillus subtilis is a member of the trans-A T PKS family and is responsible for the biosynthesis of the broad-spectrum antibiotic bacillaene. As in other trans-A T synthases the bacillaene system employs a five enzyme "RCS cassette" to introduce a distinctive ft-methyl branch into the final functional product. In this thesis I describe the structural and functional characterisation of three of the bacillaene synt
APA, Harvard, Vancouver, ISO, and other styles
5

Wescott, James Terence. "The influence of flexible branches in flexible polymers." Thesis, University of Bristol, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.297924.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Cha, Wonhee. "Application of multiplex branched DNA method for the detection and study of avian inlfuenza [i.e. influenza] virus." The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1211475165.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Stix, Volker. "Target oriented branch & bound method for global optimization." Institut für Informationsverarbeitung und Informationswirtschaft, WU Vienna University of Economics and Business, 2002. http://epub.wu.ac.at/1696/1/document.pdf.

Full text
Abstract:
We introduce a very simple but efficient idea for branch & bound (B&B) algorithms in global optimization (GO). As input for our generic algorithm, we need an upper bound algorithm for the GO maximization problem and a branching rule. The latter reduces the problem into several smaller subproblems of the same type. The new B&B approach delivers one global optimizer or, if stopped before finished, improved upper and lower bounds for the problem. Its main difference to commonly used B&B techniques is its ability to approximate the problem from above and from below while traversing the problem tre
APA, Harvard, Vancouver, ISO, and other styles
8

Stix, Volker. "Stochastic branch & bound applying target oriented branch & bound method to optimal scenario tree reduction." Institut für Informationsverarbeitung und Informationswirtschaft, WU Vienna University of Economics and Business, 2002. http://epub.wu.ac.at/1212/1/document.pdf.

Full text
Abstract:
In this article a new branch & bound method is described. It uses an artificial target to improve its bounding capabilities. Therefore the new approach is faster compared to the classical one. It is applied to the stochastic problem of optimal scenario tree reduction. The aspects of global optimization are emphasized here. All necessary components for that problem are developed and some experimental results underline the benefits of the new approach. (author's abstract)<br>Series: Working Papers on Information Systems, Information Business and Operations
APA, Harvard, Vancouver, ISO, and other styles
9

Carnell, Peter Hamilton. "Intramural Stress and Inflammation in Arterial Branches: A Histology-Based Approach." Diss., Available online, Georgia Institute of Technology, 2004:, 2004. http://etd.gatech.edu/theses/available/etd-09072004-125839/unrestricted/carnell%5Fpeter%5Fh%5F200412%5Fphd.pdf.

Full text
Abstract:
Thesis (Ph. D.)--Mechanical Engineering, Georgia Institute of Technology, 2005.<br>Guldberg, Robert E., Committee Member ; Levenston, Marc E., Committee Member; Vito, Raymond P., Committee Chair ; Taylor, W. Robert, Committee Member ; Giddens, Don P., Committee Member. Vita. Includes bibliographical references.
APA, Harvard, Vancouver, ISO, and other styles
10

Chan, Ka-man Carmen. "Design and synthesis of luminescent branched multinuclear platinum(II) alkynyl complexes and the study of their two-photon absorption properties." Click to view the E-thesis via HKUTO, 2010. http://sunzi.lib.hku.hk/hkuto/record/B43703653.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Ryoo, Moo Bong. "A constraint branch-and-bound method for set partitioning problems." Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA227092.

Full text
Abstract:
Thesis (M.S. in Operations Research)--Naval Postgraduate School, March 1990.<br>Thesis Advisor(s): Wood, R. Kevin. Second Reader: Brown, Gerald Gerard. "March 1990." Description based on signature page as viewed on October 21, 2009. Author(s) subject terms: Set partitioning problem, constraint branch and bound method, enumeration tree. Includes bibliographical references (p. 34-36). Also available online.
APA, Harvard, Vancouver, ISO, and other styles
12

Frier, Jason Ross. "Genetic Algorithms as a Viable Method of Obtaining Branch Coverage." UNF Digital Commons, 2017. http://digitalcommons.unf.edu/etd/722.

Full text
Abstract:
Finding a way to automate the generation of test data is a crucial aspect of software testing. Testing comprises 50% of all software development costs [Korel90]. Finding a way to automate testing would greatly reduce cost and labor involved in the task of software testing. One of the ways to automate software testing is to automate the generation of test data inputs. For example, in statement coverage, creating test cases that will cover all of the conditions required when testing that program would be costly and time-consuming if undertaken manually. Therefore, a way must be found that allows
APA, Harvard, Vancouver, ISO, and other styles
13

Chan, Ka-man Carmen, and 陳嘉敏. "Design and synthesis of luminescent branched multinuclear platinum(II)alkynyl complexes and the study of their two-photon absorptionproperties." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B43703653.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Patterson, Kenzee. "A tree branches, so does a river: responsively (dis)placing materialities and subjectivities in postcolonizing Australia." Thesis, The University of Sydney, 2018. http://hdl.handle.net/2123/18128.

Full text
Abstract:
My family has a connection to the area surrounding and including Lismore, a city in northern New South Wales, spanning seven generations of continuous occupation. In the first half of the nineteenth century, my ancestors were among the first non-Indigenous people to invade this Country in search of the valuable timber species, red cedar (Toona ciliata). Within this research project, I have been tracking the displacement and contemporary condition of this material, with a focus on the symbiotic relationship between the tree and the cedar tip moth (Hypsipyla robusta). Through some of the creativ
APA, Harvard, Vancouver, ISO, and other styles
15

Tao, Chi-hang, and 陶志恆. "Synthesis and luminescence studies of branched carbonrich platinum(II)and palladium(II) alkynyl complexes: versatile building blocks for multinuclear assemblies." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B31246011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Galymov, Birzhan. "Distribution Network Reconfiguration For Loss Reduction By Multi-branch Exchange Method." Master's thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614663/index.pdf.

Full text
Abstract:
As structure and size of electric power distribution systems are getting more complex, distribution automation schemes become more attractive. One of the features that is desirable in an automated system is feeder reconfiguration for loss reduction. Loss reduction can make considerable savings for a utility and results in released system capacity. There is also improved voltage regulation in the system as a result of reduced feeder voltage drop. In this thesis, multi branch exchange algorithm is introduced to solve the network reconfiguration for loss reduction problem. The proposed technique
APA, Harvard, Vancouver, ISO, and other styles
17

Hu, Sha S. M. Massachusetts Institute of Technology. "Semidefinite relaxation based branch-and-bound method for nonconvex quadratic programming." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/39217.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2006.<br>Includes bibliographical references (leaves 73-75).<br>In this thesis, we use a semidefinite relaxation based branch-and-bound method to solve nonconvex quadratic programming problems. Firstly, we show an interval branch-and-bound method to calculate the bounds for the minimum of bounded polynomials. Then we demonstrate four SDP relaxation methods to solve nonconvex Box constrained Quadratic Programming (BoxQP) problems and the comparison of the four methods. For some lower dimension
APA, Harvard, Vancouver, ISO, and other styles
18

Wei, Yuchen. "Reliability Analysis Method and Network Optimization of 5G Backhaul Network for Operators." Thesis, The University of Sydney, 2021. https://hdl.handle.net/2123/25483.

Full text
Abstract:
Communication network reliability analysis is of great significance in the practice of network construction management and operation of telecom operators. It can provide an important scientific basis for the formulation of network construction strategy and the optimization and adjustment of network performance. Combining the theoretical results of reliability analysis with engineering application practice effectively in communication network operation has always been a research difficulty in communication network operation, which has high theoretical research value and market application prosp
APA, Harvard, Vancouver, ISO, and other styles
19

Sattrawut, Ponboon. "EXACT SOLUTIONS FOR LOCATION-ROUTING PROBLEMS WITH TIME WINDOWS USING BRANCH-AND-PRICE METHOD." 京都大学 (Kyoto University), 2015. http://hdl.handle.net/2433/202692.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Mutlu, Mustafa Cagdas. "A Branch And Bound Algorithm For Resource Leveling Problem." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12612259/index.pdf.

Full text
Abstract:
Resource Leveling Problem (RLP) aims to minimize undesired fluctuations in resource distribution curves which cause several practical problems. Many studies conclude that commercial project management software packages can not effectively deal with RLP. In this study a branch and bound algorithm is presented for solving RLP for single and multi resource, small size networks. The algorithm adopts a depth-first strategy and stores start times of non-critical activities in the nodes of the search tree. Optimal resource distributions for 4 different types of resource leveling metrics can be obtain
APA, Harvard, Vancouver, ISO, and other styles
21

Poliquit, Elmer S. "A method for solving the minimization of the maximum number of open stacks problem within a cutting process." View electronic thesis, 2008. http://dl.uncw.edu/etd/2008-1/r1/poliquite/elmerpoliquit.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Jahn, Sascha. "Analyse von Open-Source-Software zur Unterstützung operativer Virtueller Unternehmen – eine Bewertungsmethode am Beispiel der Biotechnologie-Branche." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-204285.

Full text
Abstract:
Aus der Einleitung: "Virtuelle Organisationen sind zu einem festen Bestandteil des wirtschaftlichen und gesellschaftlichen Gesamtgefüges geworden. Ihre Mitglieder verfolgen mit ihnen ein gemeinsames Ziel, arbeiten dabei zeitlich und räumlich verteilt und überwinden sowohl Unternehmensgrenzen als auch kulturelle Barrieren. Als Enabler ihrer zielgerichteten, arbeitsteiligen Prozesse dient hierbei die Informations- und Kommunikationstechnologie (IuK). Ihre Aufgabe ist die effiziente Unterstützung der Gemeinschaftsmitglieder in den Kommunikations-, Koordinations- und Kooperationsprozessen der Zusa
APA, Harvard, Vancouver, ISO, and other styles
23

Jahn, Sascha. "Analyse von Open-Source-Software zur Unterstützung operativer Virtueller Unternehmen – eine Bewertungsmethode am Beispiel der Biotechnologie-Branche." Technische Universität Dresden, 2004. https://tud.qucosa.de/id/qucosa%3A29569.

Full text
Abstract:
Aus der Einleitung: "Virtuelle Organisationen sind zu einem festen Bestandteil des wirtschaftlichen und gesellschaftlichen Gesamtgefüges geworden. Ihre Mitglieder verfolgen mit ihnen ein gemeinsames Ziel, arbeiten dabei zeitlich und räumlich verteilt und überwinden sowohl Unternehmensgrenzen als auch kulturelle Barrieren. Als Enabler ihrer zielgerichteten, arbeitsteiligen Prozesse dient hierbei die Informations- und Kommunikationstechnologie (IuK). Ihre Aufgabe ist die effiziente Unterstützung der Gemeinschaftsmitglieder in den Kommunikations-, Koordinations- und Kooperationsprozessen der Zusa
APA, Harvard, Vancouver, ISO, and other styles
24

Ku, Wen-Yang. "Lattice preconditioning for the real relaxation based branch and bound method for integer least squares problems." Thesis, McGill University, 2012. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=106555.

Full text
Abstract:
Lattice basis reduction is a powerful tool for solving complex problems both in pure mathematics and practical applications. In this thesis, we use lattice basis reduction as a preconditioning technique to accelerate the real relaxation based branch and bound (RRBB) method for solving integer least squares (ILS) problems. We give theoretical arguments and simulation results to show that applying lattice preconditioning to the RRBB method can greatly reduce the size of the RRBB tree for ordinary ILS problems, making the method more efficient. We then propose new reduction strategies, which are
APA, Harvard, Vancouver, ISO, and other styles
25

Albinski, Szymon Janusz. "A branch-and-cut method for the Vehicle Relocation Problem in the One-Way Car-Sharing." Thesis, KTH, Optimeringslära och systemteori, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166720.

Full text
Abstract:
The purpose of this thesis is to develop an algorithm which solves the Vehicle Relocation Problem in the One-Way Car-Sharing (VRLPOWCS) as fast as possible. The problem describes the task of relocating the cars to areas with the largest demand. The chauffeurs who relocate the cars are transported by shuttle buses. Each car is assigned an individual relocation utility. The objective is to find shuttle tours that maximise in a given time the relocation utility while balancing the distribution of the cars. The VRLPOWCS is formulated as a mixed integer linear program. Since this problem is NP-comp
APA, Harvard, Vancouver, ISO, and other styles
26

Pao, Hsueh-yuan 1954. "ELECTROMAGNETIC SCATTERING FROM A BRANCH LINE IN A PARALLEL PLATE WAVEGUIDE (METHOD OF MOMENTS, TRANSIENT FIELDS)." Thesis, The University of Arizona, 1986. http://hdl.handle.net/10150/276837.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Kim, Seon Ki. "Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem." Diss., Virginia Tech, 2009. http://hdl.handle.net/10919/37487.

Full text
Abstract:
The work presented in this dissertation has been focused on exploiting the branch-and-price (BNP) method for the solution of various stochastic mixed integer programming problems (MIPs). In particular, we address the stochastic generalized assignment problem (SGAP), a hospital staff scheduling problem (HSSP), a stochastic hospital staff scheduling problem (SHSSP), and a stochastic short-term personnel planning problem (SSTPP). The BNP method has been developed in concert with the dual stabilization technique and other enhancements of this method for each of these problems. In view of an excess
APA, Harvard, Vancouver, ISO, and other styles
28

Furtado, Maria Gabriela Stevanato. "O problema de roteamento e programação de navios com coleta e entrega na indústria de petróleo : modelagem e métodos de solução exatos." Universidade Federal de São Carlos, 2016. https://repositorio.ufscar.br/handle/ufscar/8486.

Full text
Abstract:
Submitted by Alison Vanceto (alison-vanceto@hotmail.com) on 2017-01-24T10:38:55Z No. of bitstreams: 1 TeseMGSF.pdf: 2372267 bytes, checksum: 33d2a1fb8316befd39ea4c2aa4e6a69e (MD5)<br>Approved for entry into archive by Camila Passos (camilapassos@ufscar.br) on 2017-02-08T10:50:29Z (GMT) No. of bitstreams: 1 TeseMGSF.pdf: 2372267 bytes, checksum: 33d2a1fb8316befd39ea4c2aa4e6a69e (MD5)<br>Approved for entry into archive by Camila Passos (camilapassos@ufscar.br) on 2017-02-08T10:51:23Z (GMT) No. of bitstreams: 1 TeseMGSF.pdf: 2372267 bytes, checksum: 33d2a1fb8316befd39ea4c2aa4e6a69e (MD5)<br>M
APA, Harvard, Vancouver, ISO, and other styles
29

Villela, Pedro Ferraz 1982. "Um algoritmo exato para a otimização de carteiras de investimento com restrições de cardinalidade." [s.n.], 2008. http://repositorio.unicamp.br/jspui/handle/REPOSIP/307123.

Full text
Abstract:
Orientador: Francisco de Assis Magalhães Gomes Neto<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica<br>Made available in DSpace on 2018-08-12T16:09:04Z (GMT). No. of bitstreams: 1 Villela_PedroFerraz_M.pdf: 727069 bytes, checksum: d87d64ae49bfc1a53017a463cf10b453 (MD5) Previous issue date: 2008<br>Resumo: Neste trabalho, propomos um método exato para a resolução de problemas de programação quadrática que envolvem restrições de cardinalidade. Como aplicação, empregamos o método para a obtenção da fronteira eficiente d
APA, Harvard, Vancouver, ISO, and other styles
30

Amrani-Benhalima, Faïza. "Problèmes de MIN-MAX en variables 0-1 : Algorithmes de résolution exacts et approchés." Valenciennes, 1997. https://ged.uphf.fr/nuxeo/site/esupversions/6fb2c7ce-df58-4bc6-bb55-a1a7c0529fcf.

Full text
Abstract:
Le problème de Minmax en variables continues ou en variables entières a toujours suscité un intérêt croissant d'une part, parce que son champs d'application est vaste. Que ce soit dans le domaine des mathématiques, l'allocation de ressource, l'économie, l'aéronautique et même des jeux. D'autres part, parce que les problèmes traités sont classés en théorie de la complexité comme NP-difficile même quand il s'agit d'un problème de Minmax en variables 0-1 sans contrainte et avec seulement deux objectifs. Cette thèse contribue à l'étude des problèmes en variables bivalentes. Elle propose la résolut
APA, Harvard, Vancouver, ISO, and other styles
31

Inkmann, Torsten. "Tree-based decompositions of graphs on surfaces and applications to the traveling salesman problem." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/22583.

Full text
Abstract:
Thesis (Ph. D.)--Mathematics, Georgia Institute of Technology, 2008.<br>Committee Chair: Thomas, Robin; Committee Co-Chair: Cook, William J.; Committee Member: Dvorak, Zdenek; Committee Member: Parker, Robert G.; Committee Member: Yu, Xingxing.
APA, Harvard, Vancouver, ISO, and other styles
32

Oliveira, Lilian Kátia de. "Métodos exatos baseados em relaxação lagrangiana e surrogate para o problema de carregamento de paletes do produtor." Universidade Federal de São Carlos, 2004. https://repositorio.ufscar.br/handle/ufscar/3407.

Full text
Abstract:
Made available in DSpace on 2016-06-02T19:50:17Z (GMT). No. of bitstreams: 1 TeseLKO.pdf: 834201 bytes, checksum: 994d7b70c6b1001f9dec962fafc8b72e (MD5) Previous issue date: 2004-12-13<br>Universidade Federal de Sao Carlos<br>The purpose of this work is to develop exact methods, based on Lagrangean and Surrogate relaxation, with good performance to solve the manufacturer s pallet loading problem. This problem consists of orthogonally arranging the maximum number of rectangles of sizes (l,w) and (w,l) into a larger rectangle (L,W) without overlapping. Such methods involve a tree search proced
APA, Harvard, Vancouver, ISO, and other styles
33

Alves, Alexsandro de Oliveira. "IntegraÃÃo de heurÃsticas lagrangeanas com algoritmos exatos para a otimizaÃÃo de particionamento de conjuntos." Universidade Federal do CearÃ, 2007. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1374.

Full text
Abstract:
FundaÃÃo Cearense de Apoio ao Desenvolvimento Cientifico e TecnolÃgico<br>Neste trabalho avaliamos mÃtodos heurÃsticos e exatos para o Problema de Particionamento de Conjuntos (PPC). Realizamos testes computacionais com heurÃsticas lagrangeanas baseadas em algoritmos gulosos, busca tabu e mÃtodo de otimizaÃÃo pelo subgradiente. Os resultados obtidos, comparados com os da literatura, comprovam a eficiÃncia de nossas heurÃsticas na obtenÃÃo de limites inferiores e superiores de boa qualidade, em tempo computacional razoÃvel, para instÃncias da literatura. Utilizamos um esquema de Branch and Boun
APA, Harvard, Vancouver, ISO, and other styles
34

Alves, Alexsandro de Oliveira. "Integração de heurísticas lagrangeanas com algoritmos exatos para a otimização de particionamento de conjuntos." reponame:Repositório Institucional da UFC, 2007. http://www.repositorio.ufc.br/handle/riufc/16938.

Full text
Abstract:
ALVES, Alexsandro de Oliveira. Integração de heurísticas lagrangeanas com algoritmos exatos para a otimização de particionamento de conjuntos. 2007. 49 f. : Dissertação (mestrado) - Universidade Federal do Ceará, Centro de Ciências, Departamento de Computação, Fortaleza-CE, 2007.<br>Submitted by guaracy araujo (guaraa3355@gmail.com) on 2016-05-20T18:05:04Z No. of bitstreams: 1 2007_dis_aoalves.pdf: 434539 bytes, checksum: d7550e0ddf22c4c083e44734e59375f7 (MD5)<br>Approved for entry into archive by guaracy araujo (guaraa3355@gmail.com) on 2016-05-20T18:08:40Z (GMT) No. of bitstreams: 1 2007_dis
APA, Harvard, Vancouver, ISO, and other styles
35

Lazzeri, Doglas Batista. "Níveis de isoleucina digestível para suínos machos castrados dos 15 aos 30 kg." Universidade Estadual do Oeste do Paraná, 2011. http://tede.unioeste.br:8080/tede/handle/tede/1632.

Full text
Abstract:
Made available in DSpace on 2017-07-10T17:48:26Z (GMT). No. of bitstreams: 1 Doglas_Lazzeri.pdf: 319692 bytes, checksum: ab1f14cee65939d583d1aaf7427d892d (MD5) Previous issue date: 2011-07-29<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>Aiming to determine the digestible isoleucine requirement for barrows from 15 to 30 kg, two experiments were conducted, being one of digestibility and another of performance. Ten crossbreed barrows with average initial weight of 15.00 ± 0.27 kg were used to determine the ileal digestibility coefficient of amino acids from basal diet. Th
APA, Harvard, Vancouver, ISO, and other styles
36

Patel, Chirag B. "A multi-objective stochastic approach to combinatorial technology space exploration." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29647.

Full text
Abstract:
Thesis (Ph.D)--Aerospace Engineering, Georgia Institute of Technology, 2009.<br>Committee Chair: Dr. Dimitri N. Mavris; Committee Member: Dr. Brian J. German; Committee Member: Dr. Daniel P. Schrage; Committee Member: Dr. Frederic Villeneuve; Committee Member: Dr. Michelle R. Kirby; Committee Member: Ms. Antje Lembcke. Part of the SMARTech Electronic Thesis and Dissertation Collection.
APA, Harvard, Vancouver, ISO, and other styles
37

Bernardes, Marcos Silveira. "Efeito de métodos químicos de indução de copa no desenvolvimento da seringueira (Hevea brasiliensis Muell. Arg. cv. RRIM 600)." Universidade de São Paulo, 1990. http://www.teses.usp.br/teses/disponiveis/11/11136/tde-22032013-155959/.

Full text
Abstract:
Objetivando-se estudar o efeito de métodos químicos de indução de copa no desenvolvimento da seringueira, realizou-se experimento em condições de campo, em Casa Branca-SP, aplicando-se reguladores vegetais de crescimento em plantas enxertadas do cultivar RRIM 600 com 20 meses de idade, com 1,70 a 3,00 m de altura e último lançamento foliar maduro. O experimento foi delineado em Blocos ao Acaso com quatro repetições, utilizando-se como tratamentos, a aplicação de hidrazida maléica a 500, 750 e 1. 000 ppm, chlormequat a 1.000, 1.500 e 2.000 ppm, daminozide a 2.000, 3.000 e 4.000 ppm e a testem
APA, Harvard, Vancouver, ISO, and other styles
38

Homem, Thiago Pedro Donadon. "Procedimento híbrido envolvendo os métodos primal-dual de pontos interiores e branch and bound em problemas multiobjetivo de aproveitamento de resíduos de cana-de-açúcar /." Bauru : [s.n.], 2010. http://hdl.handle.net/11449/87192.

Full text
Abstract:
Orientador: Antonio Roberto Balbo<br>Banca: Aparecido Nilceu Marana<br>Banca: Helenice de Oliveira F. Silva<br>Resumo: O Brasil é o maior produtor de cana-de-açúcar do mundo. Mas, existe uma grande preocupação com o sistema de colheita utilizado nesta cultura, pois é prática comum a colheita manual com a pré-queima do palhiço. Autoridades brasileiras têm aprovado leis proibindo a queimada nos canaviais. Entretanto, a colheita mecanizada, com cana-de-açúcar crua, cria novos problemas com a permanência do resíduo no solo. Assim, muitos estudos têm sido propostos para o uso deste resíduo para ger
APA, Harvard, Vancouver, ISO, and other styles
39

Homem, Thiago Pedro Donadon [UNESP]. "Procedimento híbrido envolvendo os métodos primal-dual de pontos interiores e branch and bound em problemas multiobjetivo de aproveitamento de resíduos de cana-de-açúcar." Universidade Estadual Paulista (UNESP), 2010. http://hdl.handle.net/11449/87192.

Full text
Abstract:
Made available in DSpace on 2014-06-11T19:22:34Z (GMT). No. of bitstreams: 0 Previous issue date: 2010-08-24Bitstream added on 2014-06-13T18:07:18Z : No. of bitstreams: 1 homem_tpd_me_bauru.pdf: 3557697 bytes, checksum: a1fa6fe9ed118fd4c4f8be6400b6d78f (MD5)<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)<br>O Brasil é o maior produtor de cana-de-açúcar do mundo. Mas, existe uma grande preocupação com o sistema de colheita utilizado nesta cultura, pois é prática comum a colheita manual com a pré-queima do palhiço. Autoridades brasileiras têm aprovado leis proibindo a q
APA, Harvard, Vancouver, ISO, and other styles
40

Degirmenci, Guvenc. "The Budget Constrained Discrete Time/cost Trade-off Problem In Project Networks." Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/12609737/index.pdf.

Full text
Abstract:
The time/cost trade-off models in project management aim to compress the project completion time by accelerating the activity durations at an expense of additional resources. The budget problem in discrete time/cost trade-off scheduling selects the time/cost mode -among the discrete set of specified modes- for each activity so as to minimize the project completion time without exceeding the available budget. There may be alternative modes that solve the budget problem optimally, however each solution may have a different total cost value. In this study we aim to find the minimum cost solu
APA, Harvard, Vancouver, ISO, and other styles
41

Villela, Pedro Ferraz 1982. "Um algoritmo exato para obter o conjunto solução de problemas de portfólio." [s.n.], 2014. http://repositorio.unicamp.br/jspui/handle/REPOSIP/307117.

Full text
Abstract:
Orientador: Francisco de Assis Magalhães Gomes Neto<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Matemática Estatística e Computação Científica<br>Made available in DSpace on 2018-08-25T19:03:25Z (GMT). No. of bitstreams: 1 Villela_PedroFerraz_D.pdf: 10794575 bytes, checksum: 746b8aebf0db423d557d9c5fe1446592 (MD5) Previous issue date: 2014<br>Resumo: Neste trabalho, propomos um método exato para obter o conjunto solução de um problema biobjetivo quadrático de otimização de carteiras de investimento, que envolve variáveis binárias. Nosso algoritmo é baseado na junção
APA, Harvard, Vancouver, ISO, and other styles
42

Rawlston, Jonathan A. "Multiscale modeling of free-radical polymerization kinetics." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/33933.

Full text
Abstract:
Polymer chain microstructure, including characteristics such as molecular weight and branch length, can impact the end-use properties of the polymer. The assumptions contained in deterministic models prevent examination of the structure of individual polymer chains, so removal of these assumptions is necessary to gain insight into molecular-level mechanisms that determine chain microstructure. The work presented here uses a combination of stochastic and deterministic models to examine two significant mechanistic issues in free radical polymerization. The zero-one assumption concerning the n
APA, Harvard, Vancouver, ISO, and other styles
43

Leca, Marie. "La gestion prévisionnelle des emplois et des compétences du point de vue du droit social." Thesis, Bordeaux, 2015. http://www.theses.fr/2015BORD0402.

Full text
Abstract:
La gestion prévisionnelle des emplois et des compétences est une locution appartenant au vocabulaire gestionnaire ce qui lui confère une dimension organisationnelle indéniable et originelle. En droit la notion bénéficie depuis son apparition dans le Code du travail d'une indéniable publicité bien qu'elle préexistait à cette juridification. Elle garde malgré cela une certaine dose de mystère qui tient en partie aux relations qu'elle a longtemps entretenu avec les licenciements pour motif économique, à la pluralité des thématiques qui la composent ainsi qu'aux évolutions constantes de son régime
APA, Harvard, Vancouver, ISO, and other styles
44

Sa, Shibasaki Rui. "Lagrangian Decomposition Methods for Large-Scale Fixed-Charge Capacitated Multicommodity Network Design Problem." Thesis, Université Clermont Auvergne‎ (2017-2020), 2020. http://www.theses.fr/2020CLFAC024.

Full text
Abstract:
Typiquement présent dans les domaines de la logistique et des télécommunications, le problème de synthèse de réseau multi-flot à charge fixe reste difficile, en particulier dans des contextes à grande échelle. Dans ce cas, la capacité à produire des solutions de bonne qualité dans un temps de calcul raisonnable repose sur la disponibilité d'algorithmes efficaces. En ce sens, cette thèse propose des approches lagrangiennes capables de fournir des bornes relativement proches de l'optimal pour des instances de grande taille. L'efficacité des méthodes dépend de l'algorithme appliqué pour résoudre
APA, Harvard, Vancouver, ISO, and other styles
45

Santos, Marcio Costa. "Experimentos Computacionais com ImplementaÃÃes de Conjunto por EndereÃamento Direto e o Problema de Conjunto Independente MÃximo." Universidade Federal do CearÃ, 2013. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=12674.

Full text
Abstract:
CoordenaÃÃo de AperfeiÃoamento de Pessoal de NÃvel Superior<br>A utilizaÃÃo de vetores de bits à prÃtica corrente na representaÃÃo de conjuntos por endereÃamento direto com o intuito de reduzir o espaÃo de memÃria necessÃrio e melhorar o desempenho de aplicaÃÃes com uso de tÃcnicas de paralelismo em bits. Nesta dissertaÃÃo, examinamos implementaÃÃes para representaÃÃo de conjuntos por endereÃamento direto. A estrutura bÃsica nessas implementaÃÃes à o vetor de bits. No entanto, alÃm dessa estrutura bÃsica, implementamos tambÃm duas variaÃÃes. A primeira delas consiste em uma estratificaÃÃ
APA, Harvard, Vancouver, ISO, and other styles
46

Hawkins, Caleb M. "The Recovery of an AMD-impacted Stream Treated by Steel Slag Leach Beds: A Case Study in the East Branch of Raccoon Creek, Ohio." Ohio University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1429784673.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Thai, Quynh Phong. "Analyse numérique des méthodes d'optimisation globale. Codes et simulations numériques. Applications." Rouen, 1994. http://www.theses.fr/1994ROUES069.

Full text
Abstract:
Cette thèse est consacrée à l'étude des méthodes de résolution des problèmes d'optimisation globale y compris leur implémentation sur ordinateur, les simulations numériques et aussi les applications de ces méthodes à certains problèmes industriels. Une revue systématique des techniques fondamentales utilisées en optimisation globale déterministe est présentée. Sur la base de ces techniques, des algorithmes de type approximation extérieure et séparation & évaluation sont élaborés pour la résolution de certaines classes importantes de problèmes d'optimisation globale qui font l'objet d'une reche
APA, Harvard, Vancouver, ISO, and other styles
48

Lê, Thi Hoai An. "Analyse numérique des algorithmes de l'optimisation D. C. . Approches locale et globale. Codes et simulations numériques en grande dimension. Applications." Rouen, 1994. http://www.theses.fr/1994ROUES047.

Full text
Abstract:
Cette thèse est consacrée à l'analyse qualitative et quantitative de l'optimisation d. C. (différence de deux fonctions convexes). Le chapitre I est destiné à l'étude générale de la théorie et des algorithmes de l'optimisation d. C. - approche locale. Dans le chapitre II nous nous intéressons à la fois à l'étude théorique (la dualité lagrangienne, conditions d'optimalité) et algorithmique (algorithmes globaux, DCA) du problème de minimisation d'une forme quadratique sur une boule ou une sphère euclidienne. Nous présentons dans le chapitre III deux nouvelles méthodes (méthode globale de type br
APA, Harvard, Vancouver, ISO, and other styles
49

Gruza, Jan. "Modélisation de la flexibilité des glycannes complexes en solution et en interaction avec des protéines." Grenoble 1, 1998. http://www.theses.fr/1998GRE10158.

Full text
Abstract:
Le comportement conformationnel des glycannes, et donc leur flexibilite, peuvent influencer directement la reactivite chimique et l'activite biologique de ces molecules. Dans ce travail, la modelisation moleculaire d'une serie de glycannes de complexite croissante a ete realisee en utilisant plusieurs methodes d'exploration de l'espace conformationnel, dont la methode heuristique cicada, associees a differents champs de force : mm3 et amber avec plusieurs parametrisations disponibles pour les glycannes. La validation des modeles a ete apportee par des methodes theoriques de chimie quantique et
APA, Harvard, Vancouver, ISO, and other styles
50

Rider, Flores Marcos Julio 1975. "Planejamento da expansão de sistemas de transmissão usando os modelos CC - CA e tecnicas de programação não-linear." [s.n.], 2006. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260508.

Full text
Abstract:
Orientador: Ariovaldo Verandio Garcia, Ruben Augusto Romero Lazaro<br>Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>Made available in DSpace on 2018-08-06T06:56:43Z (GMT). No. of bitstreams: 1 RiderFlores_MarcosJulio_D.pdf: 1021887 bytes, checksum: 6000961c2f5457b410ac691912476270 (MD5) Previous issue date: 2006<br>Resumo: Neste trabalho são propostos modelos matemáticos e técnicas de solução para resolver o problema de planejamento da expansão de sistemas de transmissão através de três enfoques. a) Usando o modelo de corrente alter
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!