Дисертації з теми "Matroid Constraints"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Matroid Constraints".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Reimers, Arne Cornelis [Verfasser]. "Metabolic Networks, Thermodynamic Constraints, and Matroid Theory / Arne C. Reimers." Berlin : Freie Universität Berlin, 2014. http://d-nb.info/1058587331/34.
Повний текст джерелаHarini, Desiraju Harini. "Matrix models and Virasoro constraints." Thesis, Uppsala universitet, Teoretisk fysik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-276090.
Повний текст джерелаFlieger, Wojciech. "Constraints on neutrino mixing from matrix theory." Doctoral thesis, Katowice : Uniwersytet Śląski, 2021. http://hdl.handle.net/20.500.12128/21721.
Повний текст джерелаLecharlier, Loïc. "Blind inverse imaging with positivity constraints." Doctoral thesis, Universite Libre de Bruxelles, 2014. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209240.
Повний текст джерелаDoctorat en Sciences
info:eu-repo/semantics/nonPublished
Strabic, Natasa. "Theory and algorithms for matrix problems with positive semidefinite constraints." Thesis, University of Manchester, 2016. https://www.research.manchester.ac.uk/portal/en/theses/theory-and-algorithms-for-matrix-problems-with-positive-semidefinite-constraints(5c8ac15f-9666-4682-9297-73d976bed63e).html.
Повний текст джерелаChia, Liang. "Language shift in a Singaporean Chinese family and the matrix language frame model." Thesis, University of Oxford, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365765.
Повний текст джерелаXu, Da. "Classical groups, integrals and Virasoro constraints." Diss., University of Iowa, 2010. https://ir.uiowa.edu/etd/629.
Повний текст джерелаBai, Shuanghua. "Numerical methods for constrained Euclidean distance matrix optimization." Thesis, University of Southampton, 2016. https://eprints.soton.ac.uk/401542/.
Повний текст джерелаJin, Shengzhe. "Quality Assessment Planning Using Design Structure Matrix and Resource Constraint Analysis." University of Cincinnati / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1292518039.
Повний текст джерелаMenzel, Andreas. "Constraints on the Fourth-Generation Quark Mixing Matrix from Precision Flavour Observables." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät, 2017. http://dx.doi.org/10.18452/17711.
Повний текст джерелаThe Standard Model extended by an additional sequential generation of Dirac fermions (SM4) was excluded with a significance of 5.3 sigma in 2012. This was achieved in a combined fit of the SM4 to Electroweak Precision Observables and signal strengths of the Higgs boson. This thesis complements this excludion by a fit of the SM4 to a typical set of Flavour physics observables and the results of the previously performed Electroweak Precision fit. Quantities extracted in an SM3 framework are reinterpreted in SM4 terms and the adapted theoretical expressions are given. The resultant constraints on the SM4''s CKM matrix, its potentially CP-violating phases and the mass of the new up-type quark t'' are given. To compare the relative performance of the SM4 and the SM3, this work uses the chi^2 values achieved in the fit. The values of 15.53 for the SM4 and 9.56 for the SM4 are almost perfectly consistent with both models describing the experimental data equally well with the SM3 having six degrees of freedom more. The dimuon charge asymmetry ASL was not used as a fit input because the interpretation of its measurement was subject to debate at the time when the fits were produced, but its prediction in the fit was used as an additional test of the SM4. The SM3''s prediction differs from the experimental values by about 2 sigma, and the SM4''s prediction by about 3 sigma. \par In summary, these results do not suggest that any significant reduction of the 5.3 sigma exclusion could be achieved by combining the Electroweak Precision Observables and Higgs inputs with Flavour physics data. However, the exact effect of the Flavour physics input on the significance of the SM4''s exclusion cannot be given at this point because the CKMfitter software is currently not able to perform a statistically stringent likelihood comparison of non-nested models.
Gajaweera, Ruwan Naminda. "Coupling matrix synthesis for constrained topology microwave bandpass filters." Thesis, University of Essex, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.399028.
Повний текст джерелаMorris, Craig C. "Flight Dynamic Constraints in Conceptual Aircraft Multidisciplinary Analysis and Design Optimization." Diss., Virginia Tech, 2014. http://hdl.handle.net/10919/25787.
Повний текст джерелаThis material is based on research sponsored by Air Force Research Laboratory under agreement number FA8650-09-2-3938. The U.S. Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of Air Force Research Laboratory or the U.S. Government.
Ph. D.
Ankelhed, Daniel. "On low order controller synthesis using rational constraints." Licentiate thesis, Linköping : Department of Electrical Engineering, Linköping University, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-17002.
Повний текст джерелаTong, Lei. "Constrained Nonnegative Matrix Factorization for Hyperspectral Unmixing and Its Applications." Thesis, Griffith University, 2016. http://hdl.handle.net/10072/367613.
Повний текст джерелаThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Griffith School of Engineering
Science, Environment, Engineering and Technology
Full Text
Li, Nan. "Maximum Likelihood Identification of an Information Matrix Under Constraints in a Corresponding Graphical Model." Digital WPI, 2017. https://digitalcommons.wpi.edu/etd-theses/128.
Повний текст джерелаBillson, Jeremy Paul. "The design, synthesis, and evaluation of some conformationally constrained matrix metalloprotease inhibitors." Thesis, University of Exeter, 1997. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.535965.
Повний текст джерелаAnkelhed, Daniel. "On design of low order H-infinity controllers." Doctoral thesis, Linköpings universitet, Reglerteknik, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-67869.
Повний текст джерелаMadume, Jaison Pezisai. "Covariance matrix estimation methods for constrained portfolio optimization in a South African setting." Master's thesis, University of Cape Town, 2010. http://hdl.handle.net/11427/5745.
Повний текст джерелаKabasele, Philothe Mwamba. "TESTING THE MATRIX LANGUAGE FRAME MODEL WITH EVIDENCE FROM FRENCH-LINGALA CODE-SWITCHING." OpenSIUC, 2011. https://opensiuc.lib.siu.edu/theses/616.
Повний текст джерелаLavine, Jerrold I. (Jerrold Isaac) 1968. "Parametric design constraints management using the design structure matrix : creation of an electronic catalog for a safety belt system." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/88826.
Повний текст джерелаSpalt, Taylor Brooke. "Constrained Spectral Conditioning for the Spatial Mapping of Sound." Diss., Virginia Tech, 2014. http://hdl.handle.net/10919/70868.
Повний текст джерелаPh. D.
Letournel, Marc. "Approches duales dans la résolution de problèmes stochastiques." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00938751.
Повний текст джерелаOkoloko, Innocent. "Multi-path planning and multi-body constrained attitude control." Thesis, Stellenbosch : Stellenbosch University, 2012. http://hdl.handle.net/10019.1/71905.
Повний текст джерелаENGLISH ABSTRACT: This research focuses on the development of new efficient algorithms for multi-path planning and multi-rigid body constrained attitude control. The work is motivated by current and future applications of these algorithms in: intelligent control of multiple autonomous aircraft and spacecraft systems; control of multiple mobile and industrial robot systems; control of intelligent highway vehicles and traffic; and air and sea traffic control. We shall collectively refer to the class of mobile autonomous systems as “agents”. One of the challenges in developing and applying such algorithms is that of complexity resulting from the nontrivial agent dynamics as agents interact with other agents, and their environment. In this work, some of the current approaches are studied with the intent of exposing the complexity issues associated them, and new algorithms with reduced computational complexity are developed, which can cope with interaction constraints and yet maintain stability and efficiency. To this end, this thesis contributes the following new developments to the field of multipath planning and multi-body constrained attitude control: • The introduction of a new LMI-based approach to collision avoidance in 2D and 3D spaces. • The introduction of a consensus theory of quaternions by applying quaternions directly with the consensus protocol for the first time. • A consensus and optimization based path planning algorithm for multiple autonomous vehicle systems navigating in 2D and 3D spaces. • A proof of the consensus protocol as a dynamic system with a stochastic plant matrix. • A consensus and optimization based algorithm for constrained attitude synchronization of multiple rigid bodies. • A consensus and optimization based algorithm for collective motion on a sphere.
AFRIKAANSE OPSOMMING: Hierdie navorsing fokus op die ontwikkeling van nuwe koste-effektiewe algoritmes, vir multipad-beplanning en veelvuldige starre-liggaam beperkte standbeheer. Die werk is gemotiveer deur huidige en toekomstige toepassing van hierdie algoritmes in: intelligente beheer van veelvuldige outonome vliegtuig- en ruimtevaartuigstelsels; beheer van veelvuldige mobiele en industrile robotstelsels; beheer van intelligente hoofwegvoertuie en verkeer; en in lug- en see-verkeersbeheer. Ons sal hier “agente” gebruik om gesamentlik te verwys na die klas van mobiele outonome stelsels. Een van die uitdagings in die ontwikkeling en toepassing van sulke algoritmes is die kompleksiteit wat spruit uit die nie-triviale agentdinamika as gevolg van die interaksie tussen agente onderling, en tussen agente en hul omgewing. In hierdie werk word sommige huidige benaderings bestudeer met die doel om die kompleksiteitskwessies wat met hulle geassosieer word, bloot te l^e. Verder word nuwe algoritmes met verminderde berekeningskompleksiteit ontwikkel. Hierdie algoritmes kan interaksie-beperkings hanteer, en tog stabiliteit en doeltreffendheid behou. Vir hierdie doel dra die proefskrif die volgende nuwe ontwikkelings by tot die gebied van multipad-beplanning van multi-liggaam beperkte standbeheer: • Die voorstel van ’n nuwe LMI-gebasseerde benadering tot botsingsvermyding in 2D en 3D ruimtes. • Die voorstel van ’n konsensus-teorie van “quaternions” deur “quaternions” vir die eerste keer met die konsensusprotokol toe te pas. • ’n Konsensus- en optimeringsgebaseerde padbeplanningsalgoritme vir veelvoudige outonome voertuigstelsels wat in 2D en 3D ruimtes navigeer. • Die bewys van ’n konsensusprotokol as ’n dinamiese stelsel met ’n stochastiese aanlegmatriks. • ’n Konsensus- en optimeringsgebaseerde algoritme vir beperkte stand sinchronisasie van veelvoudige starre liggame. • ’n Konsensus- en optimeringsgebaseerde algoritme vir kollektiewe beweging op ’n sfeer.
Menzel, Andreas [Verfasser], Heiko [Gutachter] Lacker, Peter [Gutachter] Uwer, and Thorsten [Gutachter] Feldmann. "Constraints on the Fourth-Generation Quark Mixing Matrix from Precision Flavour Observables / Andreas Menzel ; Gutachter: Heiko Lacker, Peter Uwer, Thorsten Feldmann." Berlin : Mathematisch-Naturwissenschaftliche Fakultät, 2017. http://d-nb.info/1127108956/34.
Повний текст джерелаNagurney, Anna, and Alexander Eydeland. "A Splitting Equilibration Algorithm for the Computation of Large-Scale Constrained Matrix Problems; Theoretical Analysis and Applications." Massachusetts Institute of Technology, Operations Research Center, 1990. http://hdl.handle.net/1721.1/5316.
Повний текст джерелаClaase, Etienne H. "Robust multi-H2 output-feedback approach to aerial refuelling automation of large aircraft via linear matrix inequalities." Thesis, Stellenbosch : Stellenbosch University, 2013. http://hdl.handle.net/10019.1/80195.
Повний текст джерелаENGLISH ABSTRACT: In recent years the aviation industry has shown an interest in the airborne refuelling of large transport aircraft to enable increased payload mass at take-off and to extend aircraft range. Due to the large volume of fuel to be transferred, a boom and receptacle refuelling system with a larger fuel transfer rate is employed. The refuelling operation is particularly difficult and strenuous for the pilot of the receiver aircraft, because the position of the receptacle relative to the tanker aircraft must be maintained within a narrow window for a relatively long period of time. The airborne refuelling of a large aircraft is typically much more difficult than that of a fighter aircraft, since the large aircraft is more sluggish, takes much longer to refuel, and has a relatively large distance between its refuelling receptacle and its centre of mass. These difficulties provide the motivation for developing flight control laws for Autonomous In-Flight Refuelling (AIFR) to alleviate the workload on the pilot. The objective of the research is to design a flight control system that can regulate the receptacle of a receiver aircraft to remain within the boom envelope of a tanker aircraft in light and medium turbulence. The flight control system must be robust to uncertainties in the aircraft dynamic model, and must obey actuator deflection and slew rate limits. Literature on AIFR shows a wide range of approaches, including Linear Quadratic Regulator (LQR), μ-synthesis and neural-network based adaptive control, none of which explicitly includes constraints on actuator amplitudes, actuator rates and regulation errors in the design/synthesis. A new approach to designing AIFR flight control laws is proposed, based on Linear Matrix Inequality (LMI) optimisation. The relatively new LMI technique enables optimised regulation of stochastic systems subject to time-varying uncertainties and coloured noise disturbance, while simultaneously constraining transient behaviour and multiple outputs and actuators to operate within their amplitude, saturation and slew rate limits. These constraints are achieved by directly formulating them as inequalities.
AFRIKAANSE OPSOMMING: Die lugvaart industrie toon huidiglik ’n belangstelling in die brandstof oordrag tussen twee groot vervoervliegtuie gedurende vlug, met die doel om die maksimum opstyggewig kapasiteit sowel as die maksimum ononderbroke vlugafstand vermoë van die hervulde vliegtuig te vermeerder. ’n Boom hervulling-stelsel word geïmplementeer om die hoë spoed van brandstof oordrag te voorsien. Die verrigting van vluggebonde hervulling van ’n groot, trae vliegtuig is moeiliker en meer veeleisend as bv. van ’n vegvliegtuig, veral vir die vlieënier van die hervulde vliegtuig, wat sy boom-skakel moet reguleer binne ’n relatiewe klein boom bewegingsruimte vir ’n relatiewe lang tydperk. Die kinematika betrokke speel ook ’n groter rol in ’n groot hervulde vliegtuig a.g.v. die langer afstand tussen die boom-skakel en die massa middelpunt/ draaipunt. Hierdie bied die motivering om ’n beheerstelsel te ontwikkel wat die taak outomaties uitvoer. Die doel van die navorsing is om ’n beheerstelsel te ontwerp wat die boom-skakel van die hervulde vliegtuig outomaties reguleer binne die bewegingsruimte van die boom, gedurende ligte en matige turbulensie. Daar word van die beheerder vereis om robuust te wees teen onsekerhede in die vliegtuig se meganika, sowel as om die beheer oppervlaktes en turbines van die vliegtuig binne hul defleksie-, wringkrag- en sleurtempo-perke te hou. Daar bestaan reeds ’n groot verskeidenheid van benaderings tot die outomatisering van luggebonde hervulling, onder andere LQR, μ-sintese en neurale-netwerk gebaseerde aanpasbare beheer, waarvan geeneen perke op aktueerders en regulasie foute direk in die ontwerp insluit nie. ’n Nuwe benadering word voorgestel wat gebaseer is op Linear Matrix Inequality (LMI) optimering. Die LMI tegniek is relatief nuut in die gebruik van beheerstelsel ontwerp. Dit stel die ontwerper in staat om ’n stogastiese stelsel, onderworpe aan tydvariante-stelsel-variasie en gekleurde ruis versteurings, optimaal te reguleer, terwyl aktueerders en stelsel gedrag direk beperk word.
Roy, Prateep Kumar. "Analysis & design of control for distributed embedded systems under communication constraints." Phd thesis, Université Paris-Est, 2009. http://tel.archives-ouvertes.fr/tel-00534012.
Повний текст джерелаKoller, Angela Erika. "The frequency assignment problem." Thesis, Brunel University, 2004. http://bura.brunel.ac.uk/handle/2438/4967.
Повний текст джерелаBalasubramaniam, Thirunavukarasu. "Matrix/tensor factorization with selective coordinate descent: Algorithms and output usage." Thesis, Queensland University of Technology, 2020. https://eprints.qut.edu.au/203189/1/Thirunavukarasu_Balasubramaniam_Thesis.pdf.
Повний текст джерелаBalachandran, Libish Kalathil. "Computational workflow management for conceptual design of complex systems : an air-vehicle design perspective." Thesis, Cranfield University, 2007. http://dspace.lib.cranfield.ac.uk/handle/1826/5070.
Повний текст джерелаNapolitano, Ralph E. Jr. "Finite differenc-cellular automation modeling of the evolution of interface morphology during alloy solidification under geometrical constraint : application to metal matrix composite solidification." Diss., Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/32810.
Повний текст джерелаPérez, Pérez Luis. "Time-Dependent Amplitude Analysis of Bºc→Ksπ+π- decays with the BABAR Experiment and constraints on the CKM matrix using the B →*π and B →RhoK modes". Paris 7, 2008. http://www.theses.fr/2008PA077229.
Повний текст джерелаThis work aimed at studying the response of microorganisms to toxic elements, such as arsenic and to the lethal effects of mineral precipitation within cellular structures. We applied microscopic and spectroscopic tools adapted to the study of these organic-mineral assemblages. In a first section, we studied two different bacterial strains, both using Fe(II) as an electron donor under strictly anoxic conditions at neutral pH. The phototrophic strain SW2 precipitated iron on lipo-polysaccharidic fibres only at distance from the cells, whereas the denitrifying strain BoFeNl precipitated iron within its periplasm. Ultrafine cellular structures and proteins were preserved within these encrusted cells that can be considered as microfossils. In a second section, we studied unicellular eukaryotes from a Fe and As-rich acid mine drainage. Iron accumulation within the cells was shown to be completely decoupled from the processes of arsenic detoxification. Arsenic detoxification starts with As(V) reduction to As(III), followed by its complexation by thiol groups, involving the glutathione pathway and leading to its export from the cell. However, we show that As(V) was more toxic to the cells than As(III). Our results altogether provide new insights on the mechanisms of microbial biomineralization and detoxification of metals/metalloids and opens new perspectives for the search of biosignatures of specific metabolisms
寛康, 阿部, and Hiroyasu Abe. "Extensions of nonnegative matrix factorization for exploratory data analysis." Thesis, https://doors.doshisha.ac.jp/opac/opac_link/bibid/BB13001149/?lang=0, 2017. https://doors.doshisha.ac.jp/opac/opac_link/bibid/BB13001149/?lang=0.
Повний текст джерелаNonnegative matrix factorization (NMF) is a matrix decomposition technique to analyze nonnegative data matrices, which are matrices of which all elements are nonnegative. In this thesis, we discuss extensions of NMF for exploratory data analysis considering common features of a real nonnegative data matrix and an easy interpretation. In particular, we discuss probability distributions and divergences for zero-inflated data matrix and data matrix with outliers, two-factor vs. three-factor, and orthogonal constraint to factor matrices.
博士(文化情報学)
Doctor of Culture and Information Science
同志社大学
Doshisha University
Kim, Jingu. "Nonnegative matrix and tensor factorizations, least squares problems, and applications." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42909.
Повний текст джерелаThapa, Nirmal. "CONTEXT AWARE PRIVACY PRESERVING CLUSTERING AND CLASSIFICATION." UKnowledge, 2013. http://uknowledge.uky.edu/cs_etds/15.
Повний текст джерелаHeß, Sibylle Charlotte [Verfasser], Katharina [Akademischer Betreuer] Morik, and Arno P. J. M. [Gutachter] Siebes. "A mathematical theory of making hard decisions: model selection and robustness of matrix factorization with binary constraints / Sibylle Charlotte Heß ; Gutachter: Arno P. J. M. Siebes ; Betreuer: Katharina Morik." Dortmund : Universitätsbibliothek Dortmund, 2018. http://d-nb.info/1196874735/34.
Повний текст джерелаHeß, Sibylle [Verfasser], Katharina [Akademischer Betreuer] Morik, and Arno P. J. M. [Gutachter] Siebes. "A mathematical theory of making hard decisions: model selection and robustness of matrix factorization with binary constraints / Sibylle Charlotte Heß ; Gutachter: Arno P. J. M. Siebes ; Betreuer: Katharina Morik." Dortmund : Universitätsbibliothek Dortmund, 2018. http://d-nb.info/1196874735/34.
Повний текст джерелаBOSE, SURACHITA. "SMART GROWTH IN THE STATE OF OHIO: CONFLICTS AND CONSTRAINTS - AN ANALYSIS AND EVALUATION OF THE EVOLUTION OF SMART GROWTH IN THE CLEVELAND AND CINCINNATI METROPOLITAN REGIONS." University of Cincinnati / OhioLINK, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1099601083.
Повний текст джерелаPérez, Pérez Luis Alejandro. "Time-Dependent Amplitude Analysis of B^0->Kspi+pi- decays with the BaBar Experiment and constraints on the CKM matrix using the B->K*pi and B->rho K modes." Phd thesis, Université Paris-Diderot - Paris VII, 2008. http://tel.archives-ouvertes.fr/tel-00379188.
Повний текст джерелаMaya, Gonzalez Martin. "Frequency domain analysis of feedback interconnections of stable systems." Thesis, University of Manchester, 2015. https://www.research.manchester.ac.uk/portal/en/theses/frequency-domain-analysis-of-feedback-interconnections-of-stable-systems(c6415a11-3417-48ba-9961-ecef80b08e0e).html.
Повний текст джерелаZemkoho, Alain B. "Bilevel programming." Doctoral thesis, Technische Universitaet Bergakademie Freiberg Universitaetsbibliothek "Georgius Agricola", 2012. http://nbn-resolving.de/urn:nbn:de:bsz:105-qucosa-89017.
Повний текст джерелаOlsson, Katarina. "Population differentiation in Lythrum salicaria along a latitudinal gradient." Doctoral thesis, Umeå : Univ, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-364.
Повний текст джерелаZeißner, Sonja Verena [Verfasser], Kevin [Akademischer Betreuer] Kröninger, and Johannes [Gutachter] Albrecht. "Development and calibration of an s-tagging algorithm and its application to constrain the CKM matrix elements |Vts| and |Vtd| in top-quark decays using ATLAS Run-2 Data / Sonja Verena Zeißner ; Gutachter: Johannes Albrecht ; Betreuer: Kevin Kröninger." Dortmund : Universitätsbibliothek Dortmund, 2021. http://d-nb.info/1238349277/34.
Повний текст джерелаMeira, Vívian 1981. "A obviação/referência disjunta em complementação sentencial : uma proposta sintático-semântica." [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/268917.
Повний текст джерелаTese (doutorado) - Universidade Estadual de Campinas, Instituto de Estudos da Linguagem
Made available in DSpace on 2018-08-22T08:47:05Z (GMT). No. of bitstreams: 1 Meira_Vivian_D.pdf: 1178142 bytes, checksum: e326a7771cea8102eee5851541fef4ea (MD5) Previous issue date: 2013
Resumo: Esta tese investiga padrões de referencialidade em complementação sentencial no português, italiano e grego moderno, especialmente, o fenômeno conhecido como obviação ou referência disjunta. Esta é uma restrição atestada nas línguas e se caracteriza pelo fato de o sujeito da oração subordinada ser obrigatoriamente disjunto em referência ao sujeito da oração matriz. Tradicionalmente, assume-se que a obviação é uma propriedade de complementação subjuntiva ou um fenômeno resultante, juntamente com o controle, da competição entre formas finitas/não-finitas. No entanto, os dados não condizem com essas hipóteses, já que a obviação é exibida tanto em complementação indicativa quanto nos contextos de infinitivo flexionado. Além disso, nem todo contexto volitivo exibe obviação. Assumindo a teoria de seleção semântica e a versão minimalista de subcategorização (cf. Adger, 2004), propomos que a obviação, exibida em complementação sentencial, é uma restrição semântica exigida por três tipos de predicados, os causativos, os volitivos e os perceptivos físicos, que serão tomados como predicados modais no sentido de serem capazes de impor restrições semânticas aos seus complementos. Estes predicados foram denominados de predicados de obviação, por compartilharem entre si algumas propriedades, como denotar leitura eventiva/não-epistêmica, exigir sujeito pronominal na encaixada independente referencialmente do sujeito matriz e subcategorizar complemento TP. Argumentamos ainda que esses predicados, devido ao seu caráter modal, selecionam semanticamente um traço [obviativo], que é transmitido ao sujeito da encaixada. Predicados de obviação se distinguem de outro grupo de predicado modal, os predicados de controle, por estes não permitirem que o argumento da encaixada seja disjunto do sujeito matriz. Esses dois grupos se distinguem de outro grupo de verbos que permitem referência livre, constituído especialmente por predicados epistêmicos, declarativos, dentre outros, que denotam leitura epistêmica/proposicional e subcategorizam complemento CP. Sintaticamente este grupo de predicados se distingue dos predicados de obviação por subcategorizarem estruturas distintas, pois, enquanto estes têm complemento TP, aqueles selecionam complemento CP. Para explicar por que obviação e controle são exibidos pelo predicado volitivo, propomos que há dois tipos de acepções no volitivo nas línguas: o volitivo padrão, que seleciona controle e o volitivo causativo, que exige obviação. Defendemos que o complemento infinitivo flexionado selecionado por causativo e perceptivo é uma estrutura TP, o que o diferencia da estrutura de infinitivo flexionado selecionada por factivos/epistêmicos/declarativos, que é tomado como um CP. Estes permitem referência livre e aqueles exigem obviação. Nossa proposta é mostrar que a obviação, exibida em complementação sentencial, não é um fenômeno restrito às línguas românicas ou às línguas que exibem a distinção finito/não-finito, mas são uma restrição semântica imposta por predicados de obviação os seus complementos e, devido a isso, essa restrição semântica será exibida por línguas que dispõem desses contextos em complementação sentencial
Abstract: This thesis investigates patterns of referentiality in sentential complementation in Portuguese, Italian and Modern Greek, especially the phenomenon known as obviation or disjoint reference. This is a constraint attested in languages, and it is characterized by the fact that the subject of the subordinate clause must be disjoint in reference to the subject of the matrix sentence. Traditionally, obviation has been assumed to be a property of subjunctive complementation, or a phenomenon arising along with the control from the competition between finite/non-finite forms. However, the data are not consistent with these hypotheses, since obviation appears in indicative complementation and inflected infinitive contexts. Moreover, obviation is not displayed in every volitional context. Based on the theory of semantic selection and a minimalist version of subcategorization (cf. Adger, 2004), this thesis proposes that obviation, in sentential complementation, is a semantic constraint required by three types of predicates, the causative, volitional and physical perceptive predicates, which will be taken as predicates able to impose semantic constraints on their complements. These predicates are called obviation predicates, which share some common properties, as denoting eventive/non-epistemic reading, they require referentially independent subject pronouns in an embedded clause, and select a TP complement. We argue that these predicates, because of their modal character, select semantically a trace [obviative], which is transmitted to the subject in the embedded clause. Obviation predicates are distinguished from another group of modal predicates, control predicates, which do not allow, in an embedded clause, an argument referentially independent from the matrix subject. These two groups are distinguished from yet another group of verbs that allow free reference, specially constituted by epistemic, declarative predicates, among others, which denote an epistemic/propositional reading and select CP complements. Syntactically, this group can be distinguished from obviation predicates by selecting distinct structures, because while these have a TP complement, the former select CP complements. To explain why both obviation and control are displayed by volitional predicates, we propose that there are two types of volitional meanings in the languages: the default volitional that selects control, and the causative volitional, that requires obviation. Furthermore, we argue that the inflected infinitive complement selected by causative and perceptive verbs is a TP structure, and they require obviation, which differ from the inflected infinitive selected by factives/epistemic/declarative verb, which take CP complements and allows free reference. The purpose of this thesis is to show that obviation, in sentential complementation, is not a phenomenon restricted to the Romance languages, or languages that exhibit a distinction between finite and non-finite forms, but that it is a semantic constraint imposed by obviation predicates on their complements and, consequently, this constraint will appear in languages which have these contexts in sentential complementation
Doutorado
Linguistica
Doutora em Linguística
Limem, Abdelhakim. "Méthodes informées de factorisation matricielle non négative : Application à l'identification de sources de particules industrielles." Thesis, Littoral, 2014. http://www.theses.fr/2014DUNK0432/document.
Повний текст джерелаNMF methods aim to factorize a non negative observation matrix X as the product X = G.F between two non-negative matrices G and F. Although these approaches have been studied with great interest in the scientific community, they often suffer from a lack of robustness to data and to initial conditions, and provide multiple solutions. To this end and in order to reduce the space of admissible solutions, the work proposed in this thesis aims to inform NMF, thus placing our work in between regression and classic blind factorization. In addition, some cost functions called parametric αβ-divergences are used, so that the resulting NMF methods are robust to outliers in the data. Three types of constraints are introduced on the matrix F, i. e., (i) the "exact" or "bounded" knowledge on some components, and (ii) the sum to 1 of each line of F. Update rules are proposed so that all these constraints are taken into account by mixing multiplicative methods with projection. Moreover, we propose to constrain the structure of the matrix G by the use of a physical model, in order to discern sources which are influent at the receiver. The considered application - consisting of source identification of particulate matter in the air around an insdustrial area on the French northern coast - showed the interest of the proposed methods. Through a series of experiments on both synthetic and real data, we show the contribution of different informations to make the factorization results more consistent in terms of physical interpretation and less dependent of the initialization
Silva, Michel Aguena da. "Cosmologia usando aglomerados de galáxias no Dark Energy Survey." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/43/43134/tde-22102017-163407/.
Повний текст джерелаAbstract Galaxy clusters are the largest bound structures of the Universe. Their distribution maps the dark matter halos formed in the deep potential wells of the dark matter field. As a result, the abundance of galaxy clusters is highly sensitive to the expansion of the universe as well as the growth of dark matter perturbations, representing a powerful tool for cosmological purposes. In the current era of large scale surveys with enormous volumes of data, the statistical quantities from the objects surveyed (galaxies, clusters, supernovae, quasars, etc) can be used to extract cosmological information. The main goal of this thesis is to explore the potential use of galaxy clusters for constraining cosmology. To that end, we study the halo formation theory, the detection of halos and clusters, the statistical tools required to quarry cosmological information from detected clusters and finally the effects of optical detection. In the composition of the theoretical prediction for the halo number counts, we analyze how each cosmological parameter of interest affects the halo abundance, the importance of the use of the halo covariance, and the effectiveness of halos on cosmological constraints. The redshift range and the use of prior knowledge of parameters are also investigated in detail. The theoretical prediction is tested on a dark matter simulation, where the cosmology is known and a dark matter halo catalog is available. In the analysis of the simulation we find that it is possible to obtain good constraints for some parameters such as (Omega_m,w,sigma_8,n_s) while other parameters (h,Omega_b) require external priors from different cosmological probes. In the statistical methods, we discuss the concept of likelihood, priors and the posterior distribution. The Fisher Matrix formalism and its application on galaxy clusters is presented, and used for making forecasts of ongoing and future surveys. For the real analysis of data we introduce Monte Carlo Markov Chain (MCMC) methods, which do not assume Gaussianity of the parameters distribution, but have a much higher computational cost relative to the Fisher Matrix. The observational effects are studied in detail. Using the Fisher Matrix approach, we carefully explore the effects of completeness and purity. We find in which cases it is worth to include extra parameters in order to lower the mass threshold. An interesting finding is the fact that including completeness and purity parameters along with cosmological parameters does not degrade dark energy constraints if other observational effects are already being considered. The use of priors on nuisance parameters does not seem to affect the dark energy constraints, unless these priors are better than 1\\%.The WaZp cluster finder was run on a cosmological simulation, producing a cluster catalog. Comparing the detected galaxy clusters to the dark matter halos, the observational effects were investigated and measured. Using these measurements, we were able to include corrections for the prediction of cluster counts, resulting in a good agreement with the detected cluster abundance. The results and tools developed in this thesis can provide a framework for the analysis of galaxy clusters for cosmological purposes. Several codes were created and tested along this work, among them are an efficient code to compute theoretical predictions of halo abundance and covariance, a code to estimate the abundance and covariance of galaxy clusters including multiple observational effects and a pipeline to match and compare halo/cluster catalogs. This pipeline has been integrated to the Science Portal of the Laboratório Interinstitucional de e-Astronomia (LIneA) and is being used to automatically assess the quality of cluster catalogs produced by the Dark Energy Survey (DES) collaboration and will be used in other future surveys.
Nguyen, Viet-Dung. "Contribution aux décompositions rapides des matrices et tenseurs." Thesis, Orléans, 2016. http://www.theses.fr/2016ORLE2085/document.
Повний текст джерелаLarge volumes of data are being generated at any given time, especially from transactional databases, multimedia content, social media, and applications of sensor networks. When the size of datasets is beyond the ability of typical database software tools to capture, store, manage, and analyze, we face the phenomenon of big data for which new and smarter data analytic tools are required. Big data provides opportunities for new form of data analytics, resulting in substantial productivity. In this thesis, we will explore fast matrix and tensor decompositions as computational tools to process and analyze multidimensional massive-data. We first aim to study fast subspace estimation, a specific technique used in matrix decomposition. Traditional subspace estimation yields high performance but suffers from processing large-scale data. We thus propose distributed/parallel subspace estimation following a divide-and-conquer approach in both batch and adaptive settings. Based on this technique, we further consider its important variants such as principal component analysis, minor and principal subspace tracking and principal eigenvector tracking. We demonstrate the potential of our proposed algorithms by solving the challenging radio frequency interference (RFI) mitigation problem in radio astronomy. In the second part, we concentrate on fast tensor decomposition, a natural extension of the matrix one. We generalize the results for the matrix case to make PARAFAC tensor decomposition parallelizable in batch setting. Then we adapt all-at-once optimization approach to consider sparse non-negative PARAFAC and Tucker decomposition with unknown tensor rank. Finally, we propose two PARAFAC decomposition algorithms for a classof third-order tensors that have one dimension growing linearly with time. The proposed algorithms have linear complexity, good convergence rate and good estimation accuracy. The results in a standard setting show that the performance of our proposed algorithms is comparable or even superior to the state-of-the-art algorithms. We also introduce an adaptive nonnegative PARAFAC problem and refine the solution of adaptive PARAFAC to tackle it. The main contributions of this thesis, as new tools to allow fast handling large-scale multidimensional data, thus bring a step forward real-time applications
Terreaux, Eugénie. "Théorie des Matrices Aléatoires pour l'Imagerie Hyperspectrale." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLC091/document.
Повний текст джерелаHyperspectral imaging generates large data due to the spectral and spatial high resolution, as it is the case for more and more other kinds of applications. For hyperspectral imaging, the data complexity comes from the spectral and spatial heterogeneity, the non-gaussianity of the noise and other physical processes. Nevertheless, this complexity enhances the wealth of collected informations, that need to be processed with adapted methods. Random matrix theory and robust processes are here suggested for hyperspectral imaging application: the random matrix theory is adapted to large data and the robustness enables to better take into account the non-gaussianity of the data. This thesis aims to enhance the model order selection on a hyperspectral image and the unmixing problem. As the model order selection is concerned, three new algorithms are developped, and the last one, more robust, gives better performances. One financial application is also presented. As for the unmixing problem, three methods that take into account the peculierities of hyperspectral imaging are suggested. The random matrix theory is of great interest for hyperspectral image processing, as demonstrated in this thesis. Differents methods developped here can be applied to other field of signal processing requiring the processing of large data
Turki, Marwa. "Synthèse de contrôleurs prédictifs auto-adaptatifs pour l'optimisation des performances des systèmes." Thesis, Normandie, 2018. http://www.theses.fr/2018NORMR064.
Повний текст джерелаEven though predictive control uses concrete parameters, the value of these latter has a strong impact on the obtained performances from the system to be controlled. Their tuning is not trivial. That is why the literature reports a number of adjustment methods. However, these ones do not always guarantee optimal values. The goal of this thesis is to propose an analytical and original tuning tuning approach of these parameters. Initially applicable to linear MIMO systems, the proposed approach has been extended to non-linear systems with or without constraints and for which a Takagi-Sugeno (T-S) model exists. The class of nonlinear systems considered here is written in quasi-linear parametric form (quasi-LPV). Assuming that the system is controllable and observable, the proposed method guarantees the optimal stability of this closed-loop system. To do this, it relies, on the one hand, on a conditioning improving technique of the Hessian matrix and, on the other hand, on the concept of effective rank. It also has the advantage of requiring a lower computational load than the approaches identified in the literature. The interest of the proposed approach is shown through the simulation on different systems of increasingcomplexity. The work carried out has led to a self-adaptive predictive control strategy called "ATSMPC" (Adaptive Takagi-Sugeno Model-based Predictive Control)
Tomek, Peter. "Approximation of Terrain Data Utilizing Splines." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2012. http://www.nusl.cz/ntk/nusl-236488.
Повний текст джерела