441 |
Tripartite Entanglement in Quantum Open SystemsWoldekristos, Habtom G. 14 August 2009 (has links)
No description available.
|
442 |
ALMOST SURE CENTRAL LIMIT THEOREMSGonchigdanzan, Khurelbaatar 11 October 2001 (has links)
No description available.
|
443 |
Optimal H-infinity controller design and strong stabilization for time-delay and mimo systemsGumussoy, Suat 29 September 2004 (has links)
No description available.
|
444 |
Proteomic studies on protein N-terminus and peptide ion mobility by nano-scale liquid chromatography/tandem mass spectrometry / ナノスケール液体クロマトグラフィー/タンデム質量分析によるタンパク質N末端およびペプチドイオンモビリティーに関するプロテオミクス研究Chang, Chih-Hsiang 23 March 2021 (has links)
京都大学 / 新制・課程博士 / 博士(薬科学) / 甲第23135号 / 薬科博第134号 / 新制||薬科||15(附属図書館) / 京都大学大学院薬学研究科薬科学専攻 / (主査)教授 石濱 泰, 教授 松﨑 勝巳, 教授 加藤 博章 / 学位規則第4条第1項該当 / Doctor of Pharmaceutical Sciences / Kyoto University / DFAM
|
445 |
[pt] BUSCA POR PARTÍCULAS TIPO ÁXION EM COLISÕES PBPB ULTRAPERIFÉRICAS NO EXPERIMENTO LHCB / [en] SEARCH FOR AXION-LIKE PARTICLES IN ULTRAPERIPHERAL PBPB COLLISIONS AT THE LHCB EXPERIMENTRENATA FERREIRA LEITE CONSIDERA 17 October 2024 (has links)
[pt] O Modelo Padrão (MP) da física de partículas é atualmente a teoria mais
aceita para descrever as interações fundamentais entre partículas elementares.
No entanto, o modelo por si só não consegue explicar vários fenómenos, desde
oscilações de neutrinos até matéria escura. Um enigma atual do MP é o
chamado problema de CP forte. Embora se saiba que a simetria de Carga-Paridade (CP) é violada pelas interações fracas, ela é conservada pela interação
forte com alta precisão. No entanto, a Lagrangeana do MP tem um termo que
poderia permitir violação de CP induzida por interação forte, e apenas um
extremo ajuste fino evitaria esse efeito. A solução poderia vir com a introdução
de uma nova partícula, o áxion. Esta ideia foi posteriormente generalizada
para uma classe mais ampla de partículas conhecidas como partículas tipo
áxions (ALPs). Apesar de extensas pesquisas, nenhuma evidência de ALPs
foi observada até hoje, sendo relatados apenas limites superiores em suas
constantes de acoplamento.
Esta dissertação descreve a busca por ALPs decaindo em um par de
fótons em colisões ultraperiféricas de PbPb a uma energia de centro de massa
de 5,02 TeV. Os dados correspondem a uma luminosidade integrada de 0,2
nb(-1)
, coletados pelo experimento LHCb. A configuração frontal do detector
LHCb é adequada para investigar ALPs de baixa massa, uma faixa desafiadora
para outros detectores. Os candidatos a fótons são reconstruídos e identificados
usando informações do calorímetro eletromagnético. Esta análise cobre uma
faixa de massa de ALP de 3 a 10 GeV e acoplamentos de ALP-fótons de
10(-1) a 1 TeV(-1)
. Embora a região de exclusão obtida seja pequena e se
sobreponha a análises recentes, este estudo demonstra o potencial, no run 3 e
além, do experimento LHCb para contribuir em pesquisas de ALP em colisões
ultraperiféricas. / [en] The Standard Model (SM) of particle physics is currently the most
accepted theory for describing the fundamental interactions among elementary
particles. However, the model alone fails to explain several phenomena, from
neutrino oscillations to dark matter. One current puzzle of the SM is the so-called strong CP problem. Although Charge-Parity (CP) symmetry is known to
be violated by the weak interactions, it is conserved by the strong interaction to
a high precision. Nevertheless, the SM Lagrangian has a term that could allow
strong-induced CP violation, and only an extreme fine-tuning would prevent
this effect. The solution could come with the introduction of a new particle, the
axion. This idea was later generalized into a broader class of particles known as
axion-like particles (ALPs). Despite extensive searches, no evidence of ALPs
has been observed so far, with only upper limits on their coupling constants
being reported.
This dissertation describes the search for ALPs decaying into a pair of
photons in ultraperipheral PbPb collisions at a center-of-mass energy of 5.02
TeV. The data corresponds to an integrated luminosity of 0.2 nb(-1)
, collected by
the LHCb experiment. The forward configuration of the LHCb detector is well-suited for investigating low-mass ALPs, a challenging range for other detectors.
Photon candidates are reconstructed and identified using information from the
electromagnetic calorimeter. Our analysis covers an ALP mass range from
3 to 10 GeV and ALP-photon couplings from 10(-1)
to 1 TeV(-1)
. Although
our exclusion region is small and overlaps with recent analyses, this study
demonstrates the potential, in run 3 and beyond, for LHCb to contribute to
ALP searches in ultraperipheral collisions.
|
446 |
Spanning Halin Subgraphs Involving Forbidden SubgraphsYang, Ping 09 May 2016 (has links)
In structural graph theory, connectivity is an important notation with a lot of applications. Tutte, in 1961, showed that a simple graph is 3-connected if and only if it can be generated from a wheel graph by repeatedly adding edges between nonadjacent vertices and applying vertex splitting. In 1971, Halin constructed a class of edge-minimal 3-connected planar graphs, which are a generalization of wheel graphs and later were named “Halin graphs” by Lovasz and Plummer. A Halin graph is obtained from a plane embedding of a tree with no stems having degree 2 by adding a cycle through its leaves in the natural order determined according to the embedding. Since Halin graphs were introduced, many useful properties, such as Hamiltonian, hamiltonian-connected and pancyclic, have been discovered. Hence, it will reveal many properties of a graph if we know the graph contains a spanning Halin subgraph. But unfortunately, until now, there is no positive result showing under which conditions a graph contains a spanning Halin subgraph. In this thesis, we characterize all forbidden pairs implying graphs containing spanning Halin subgraphs. Consequently, we provide a complete proof conjecture of Chen et al. Our proofs are based on Chudnovsky and Seymour’s decomposition theorem of claw-free graphs, which were published recently in a series of papers.
|
447 |
線性迴歸模式中最小平方估計量之收斂速率李賜郎, LI, SI-LANG Unknown Date (has links)
對於線性過歸模式之參數,一般均採最小平方估計量來估計。最小平方估計量,在適
當條件下有強一致性(Strong consistency),而本文所探討之主題,乃是針對本特
性探討其數歛速率。
本文共分五章,第一章為緒論,含研究動機、研究目的及本文結構,第二章摘介本文
所探討之模式與最小平方估計量之收歛性,第三章為引理,介紹本文所需要之預備知
識及本文所使用之方法,第四章為主要定理及證明,第五章結論。全文共計一冊,約
一萬餘字。
|
448 |
Event shapes and power corrections at HERAMcCance, Gavin John January 2001 (has links)
No description available.
|
449 |
Snarks : Generation, coverings and colouringsHägglund, Jonas January 2012 (has links)
For a number of unsolved problems in graph theory such as the cycle double cover conjecture, Fulkerson's conjecture and Tutte's 5-flow conjecture it is sufficient to prove them for a family of graphs called snarks. Named after the mysterious creature in Lewis Carroll's poem, a \emph{snark} is a cyclically 4-edge connected 3-regular graph of girth at least 5 which cannot be properly edge coloured using three colours. Snarks and problems for which an edge minimal counterexample must be a snark are the central topics of this thesis. The first part of this thesis is intended as a short introduction to the area. The second part is an introduction to the appended papers and the third part consists of the four papers presented in a chronological order. In Paper I we study the strong cycle double cover conjecture and stable cycles for small snarks. We prove that if a bridgeless cubic graph $G$ has a cycle of length at least $|V(G)|-9$ then it also has a cycle double cover. Furthermore we show that there exist cyclically 5-edge connected snarks with stable cycles and that there exists an infinite family of snarks with stable cycles of length 24. In Paper II we present a new algorithm for generating all non-isomorphic snarks with a given number of vertices. We generate all snarks on 36 vertices and less and study these with respect to various properties. We find that a number of conjectures on cycle covers and colourings holds for all graphs of these orders. Furthermore we present counterexamples to no less than eight published conjectures on cycle coverings, cycle decompositions and the general structure of regular graphs. In Paper III we show that Jaeger's Petersen colouring conjecture holds for three infinite families of snarks and that a minimum counterexample to this conjecture cannot contain a certain subdivision of $K_{3,3}$ as a subgraph. Furthermore, it is shown that one infinite family of snarks have strong Petersen colourings while another does not have any such colourings. Two simple constructions for snarks with arbitrary high oddness and resistance is given in Paper IV. It is observed that some snarks obtained from this construction have the property that they require at least five perfect matchings to cover the edges. This disproves a suggested strengthening of Fulkerson's conjecture.
|
450 |
Relationship Status: It's Complicated - The Role of Narcissism in the Development of Relationships Through FacebookSaad, Michael 13 September 2012 (has links)
The presence of both narcissism and social capital in the digital social networking site Facebook is altering the dynamic of relationship development. Therefore, the central research question directing this study is as follows: What role do narcissistic personality traits play in bridging social capital on Facebook? From this, two sub-questions are raised: 1) What are the motives for users to express narcissistic traits through Facebook? 2) How is narcissistic-motivated activity influencing social capital development through Facebook? Guiding this thesis are concepts of social tie relationships (as they apply to narcissism), and digital social networks. An exploratory study of in-depth interviews was utilized to conduct such research. A key objective in this thesis is understanding motive and purpose for generating social capital in an online environment. The findings from this study suggest Facebook is a facilitator for the expression of narcissistic traits. As a result, this is influencing the disconnected and questionable value of digital social capital.
|
Page generated in 0.0541 seconds