• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 69
  • 18
  • 15
  • 10
  • 8
  • 4
  • 4
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 145
  • 20
  • 17
  • 13
  • 13
  • 12
  • 12
  • 11
  • 10
  • 10
  • 10
  • 9
  • 9
  • 9
  • 9
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
131

The derivation and quasinormal mode spectrum of acoustic anti-de sitter black hole analogues

Babb, James Patrick 08 March 2013 (has links)
Dumb holes (also known as acoustic black holes) are fluid flows which include an "acoustic horizon:" a surface, analogous to a gravitational horizon, beyond which sound may pass but never classically return. Soundwaves in these flows will therefore experience "effective geometries" which are identical to black hole spacetimes up to a conformal factor. By adjusting the parameters of the fluid flow, it is possible to create an effective geometry which is conformal to the Anti-de Sitter black hole spacetime- a geometry which has recieved a great deal of attention in recent years due to its conjectured holographic duality to Conformal Field Theories. While we would not expect an acoustic analogue of the AdS-CFT correspondence to exist, this dumb hole provides a means, at least in principle, of experimentally testing the theoretical properties of the AdS spacetime. In particular, I have calculated the quasinormal mode spectrum of this acoustic geometry. / Graduate / 0986 / 0753 / jpbabb@yahoo.ca
132

Fast Order Basis and Kernel Basis Computation and Related Problems

Zhou, Wei 28 November 2012 (has links)
In this thesis, we present efficient deterministic algorithms for polynomial matrix computation problems, including the computation of order basis, minimal kernel basis, matrix inverse, column basis, unimodular completion, determinant, Hermite normal form, rank and rank profile for matrices of univariate polynomials over a field. The algorithm for kernel basis computation also immediately provides an efficient deterministic algorithm for solving linear systems. The algorithm for column basis also gives efficient deterministic algorithms for computing matrix GCDs, column reduced forms, and Popov normal forms for matrices of any dimension and any rank. We reduce all these problems to polynomial matrix multiplications. The computational costs of our algorithms are then similar to the costs of multiplying matrices, whose dimensions match the input matrix dimensions in the original problems, and whose degrees equal the average column degrees of the original input matrices in most cases. The use of the average column degrees instead of the commonly used matrix degrees, or equivalently the maximum column degrees, makes our computational costs more precise and tighter. In addition, the shifted minimal bases computed by our algorithms are more general than the standard minimal bases.
133

Migration of youth to Ho Chi Minh City, Vietnam: determinants of mobility and adjustment experiences.

Nguyen Thi, Hong Xoan January 2008 (has links)
As a result of the economic reforms that were introduced in Vietnam in 1986, the country has grown economically. However, due to a bias toward development policies which have been mainly concentrated in urban areas, the economic gap between rural and urban areas has rapidly widened over time. More job opportunities and better living conditions in the city, as well as low productivity in agriculture, have caused people to move to the major cities. Consequently, rural to urban migration has become one of the dominant flows of internal migration in the country in recent years. This migration stream not only has increased in scale but also in its complexity. Particularly, the age of the migrants has become younger as many young people, especially females, become involved in this flow. Moreover, this migration flow has become less selective in terms of education as both more and less educated people migrate. Also, not only the rich but the poor take part in this movement. This thesis considers the determinants of moving and the experiences of young migrants to Ho Chi Minh City in terms of their economic, social and cultural adjustment in order to provide deep insights into the lives of young people when they migrate. This thesis has used the migration model of Scharping (1997) as the theoretical framework to investigate the decision to move as well as their living experiences in the city. A multiple method approach has been used to the study as both quantitative and qualitative data were analysed. Quantitative data such as secondary data from censuses and data from large-scale surveys at the national and the city levels and primary data from the author’s survey with 300 young migrants were applied. Qualitative data from 25 in-depth interviews with young migrants, 5 with authorities and 5 with migrant returnees were used in this study, to provide detailed information on migrants’ lives. While the city has attracted a large number of youth from rural areas because of its development advantages, the city’s government has applied policies to limit this flow. Yet, this migration control policy has proved costly and ineffective in restricting the flows of people to the major cities. This policy has created many difficulties for migrants in the city. In addition, low levels of education and limited work skills force many young migrants to work in the informal sector where their human rights are heavily violated. Other young migrants work in cheap intensive-labour factories. Low pay and hard work, but without labour and medical insurance, lead these young migrants to live on the margins of urban society. These findings suggest that if the local people do not accept these migrants, and urban policies make no effort to assistance them, it is impossible for young migrants in the city to be successful in building new lives and careers. Instead of trying to limit rural to urban migration, the national government should put more effort into narrowing the rural-urban gap by improving development in rural areas. More jobs with better pay in rural areas may be the most effective and sustainable way of reducing rural to urban migration flows. / http://proxy.library.adelaide.edu.au/login?url= http://library.adelaide.edu.au/cgi-bin/Pwebrecon.cgi?BBID=1331422 / Thesis (Ph.D.) - University of Adelaide, School of Social Sciences, 2008
134

Studies of "clean" and "disordered" Bilayer Optical Lattice Systems Circumventing the 'fermionic Cooling-problem'

Prasad, Yogeshwar January 2018 (has links) (PDF)
The advancement in the eld of cold-atoms has generated a lot of interest in the condensed matter community. Cold-atom experiments can simulate clean, disor-der/impurity free systems very easily. In these systems, we have a control over various parameters like tuning the interaction between particles by the Feshbach resonance, tuning the hopping between lattice sites by laser intensity and so on. As a result, these systems can be used to mimic various theoretical models, which was hindered because of various experimental limitations. Thus, we have an ex-perimental tool in which we can start with a simple theoretical model and later tune the model experimentally and theoretically to simulate the real materials. This will be helpful in studying the physics of the real materials as we can control interactions as well as the impurities can also be taken care of. But the advance-ment in the eld of cold atoms has seen a roadblock for the fermions in optical lattices. The super uid and anti-ferromagnetic phases has not been achieved for fermions in optical lattices due to the \cooling problem" (entropy issues). In this thesis, we have addressed the issue of the \cooling problem" for fermions in optical lattice systems and studied the system with determinant quantum Monte Carlo technique. We start by giving a general idea of cold-atoms and optical lat-tice potentials, and a brief review of the experimental work going on in the cold-atomic systems. Experimental limitations like \fermionic cooling problem" have been discussed in some detail. Then we proposed a bilayer band-insulator model to circumvent the \entropy problem" and simultaneously increasing the transi-tion temperature for fermions in optical lattices. We have studied the attractive Hubbard model, which is the minimal model for fermions in optical lattices. The techniques that we have used to study the model are mean- eld theory, Gaussian uctuation theory and determinant quantum Monte Carlo numerical technique. . Chapter-1 : provides a general introduction to the ultra-cold atoms, optical lattice and Feshbach resonance. In this chapter we have discussed about cold-atom experiments in optical lattice systems. Here, we have brie y discussed the control over various parameters in the experiments. The goal of these experiments is to realize or mimic many many-body Hamiltonians in experiments, which until now was just a theoretical tool to describe various many-body physics. In the end we give a brief idea for introducing disorder in the cold-atom experiments discuss the limitations of these experiments in realizing the \interesting" super uid and anti-ferromagnetic phases of fermionic Hubbard model in optical lattices. Chapter-2 : gives a brief idea of \Determinant Quantum Monte-Carlo" (DQM C) technique that has been used to study these systems. In this chapter we will discuss the DQM C algorithm and the observables that can be calculated. We will discuss certain limitation of the DQM C algorithm like numerical instability and sign problem. We will brie y discuss how sign problem doesn't occur in the model we studied. Chapter-3 : discusses the way by which we can bypass the \cooling problem" (high entropy state) to get a fermionic super uid state in the cold atom experi-ments. In this chapter we propose a model whose idea hinges on a low-entropy band-insulator state, which can be tuned to super uid state by tuning the on-site attractive interaction by Feshbach resonance. We show through Gaussian uctua-tion theory that the critical temperature achieved is much higher in our model as compared to the single-band Hubbard model. Through detailed variational Monte Carlo calculations, we have shown that the super uid state is indeed the most stable ground state and there is no other competing order. In the end we give a proposal for its realization in the ultra-cold atom optical lattice systems. Chapter-4 : discusses the DQM C study of the model proposed in chapter- 3. Here we have studied the various single-particle properties like momentum distribution, double occupancies which can be easily measured in cold-atom ex-periments. We also studied the pair-pair and the density-density correlations in detail through DQM C algorithm and mapped out the full T U phase diagram. We show that the proposed model doesn't favor the charge density wave for the interaction strengths we are interested in. Chapter-5 : gives a brief idea of the e ect of adding an on-site random disorder in our proposed bilayer-Hubbard model. We study the e ect of random disorder on various single-particle properties which can be easily veri ed in cold-atom ex-periments. We studied the suppression of the pair-pair correlations as we increase the disorder strength in our proposed model. We nd that the critical value of the interaction doesn't change in the weak-disorder limit. We estimated the critical disorder strength needed to destroy the super uid state and argued that the tran-sition from the super uid to Bose-glass phase in presence of disorder lies in the universality class of (d + 1) XY model. In the end, we give a schematic U V phase diagram for our system. Chapter-6 : We studied the bilayer attractive Hubbard model in different lattice geometry, the bilayer honeycomb lattice, both in presence and in absence of the on-site random disorder. We discussed how the pair-pair and density-density cor-relations behave in the presence and absence of disorder. Through the finite-size scaling analysis we see the co-existence of the super fluid and the charge density wave order at half- lling. An in nitesimal disorder destroys the CDW order com-pletely while the super uid phase found to be robust against weak-disorder. We estimated the critical interaction strength, the critical temperature and the critical disorder strength through nite-size scaling, and provide a putative phase diagram for the system considered.
135

Determinants of HIV related stigma and discrimination among healthcare professionals at a health facility in Malawi

Njolomole, Stephen Emilio 06 1900 (has links)
Certain individual and institutional factors such as knowledge about stigma and discrimination, fear of infection, social judgement, legal and policy environment act as actionable drivers and facilitators of HIV-related stigma and discrimination. These factors may hinder the utilisation and quality of care provided to people living with HIV. Purpose: The purpose of the study was to establish the actionable drivers and facilitators that determine the different forms of HIV-related stigma and discrimination among healthcare professionals at a district hospital in Malawi. Methods: The study used a descriptive correlational study. Data was collected through self-administered questionnaire. Data were analysed using SPPS and STATA 12. Fisher's Exact Test was used to conclude the association and binary logistic regression was used to model the degree of the statistical relationships. Results: The results showed statistically significant relationship between knowledge of stigma and discrimination, social judgement and awareness of workplace policy and HIV-related stigma and discrimination. Recommendations: Interventions aimed at increasing knowledge about HIV-related stigma, reducing social judgement, reinforcing HIV-related workplace policies are needed to reduce HIV-related stigma and discrimination in healthcare settings. / Health Studies / M. Ph. (Health Studies)
136

Degenerations of classical square matrices and their determinantal structure

Medeiros, Rainelly Cunha de 10 March 2017 (has links)
Submitted by ANA KARLA PEREIRA RODRIGUES (anakarla_@hotmail.com) on 2017-08-25T13:37:53Z No. of bitstreams: 1 arquivototal.pdf: 1699241 bytes, checksum: 2f092c650c435ae41ec42c261fd9c3af (MD5) / Made available in DSpace on 2017-08-25T13:37:53Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 1699241 bytes, checksum: 2f092c650c435ae41ec42c261fd9c3af (MD5) Previous issue date: 2017-03-10 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / In thisthesis,westudycertaindegenerations/specializationsofthegenericsquare matrix overa eld k of characteristiczeroalongitsmainrelatedstructures,suchthe determinantofthematrix,theidealgeneratedbyitspartialderivatives,thepolarmap de ned bythesederivatives,theHessianmatrixandtheidealofsubmaximalminorsof the matrix.Thedegenerationtypesofthegenericsquarematrixconsideredhereare: (1) degenerationby\cloning"(repeating)avariable;(2)replacingasubsetofentriesby zeros, inastrategiclayout;(3)furtherdegenerationsoftheabovetypesstartingfrom certain specializationsofthegenericsquarematrix,suchasthegenericsymmetric matrix andthegenericsquareHankelmatrix.Thefocusinallthesedegenerations is intheinvariantsdescribedabove,highlightingonthehomaloidalbehaviorofthe determinantofthematrix.Forthis,weemploytoolscomingfromcommutativealgebra, with emphasisonidealtheoryandsyzygytheory. / Nesta tese,estudamoscertasdegenera c~oes/especializa c~oesdamatrizquadradagen erica sobre umcorpo k de caracter sticazero,aolongodesuasprincipaisestruturasrela- cionadas, taiscomoodeterminantedamatriz,oidealgeradoporsuasderivadasparci- ais, omapapolarde nidoporessasderivadas,amatrizHessianaeoidealdosmenores subm aximosdamatriz.Ostiposdedegenera c~aodamatrizquadradagen ericacon- siderados aquis~ao:(1)degenera c~aopor\clonagem"(repeti c~ao)deumavari avel;(2) substitui c~aodeumsubconjuntodeentradasporzeros,emumadisposi c~aoestrat egica; (3) outrasdegenera c~oesdostiposacimapartindodecertasespecializa c~oesdamatriz quadrada gen erica,taiscomoamatrizgen ericasim etricaeamatrizquadradagen erica de Hankel.Ofocoemtodasessasdegenera c~oes enosinvariantesdescritosacima, com destaqueparaocomportamentohomaloidaldodeterminantedamatriz.Paratal, empregamos ferramentasprovenientesda algebracomutativa,com^enfasenateoriade ideais enateoriadesiz gias.
137

Représentations des polynômes, algorithmes et bornes inférieures / Representations of polynomials, algorithms and lower bounds

Grenet, Bruno 29 November 2012 (has links)
La complexité algorithmique est l'étude des ressources nécessaires — le temps, la mémoire, … — pour résoudre un problème de manière algorithmique. Dans ce cadre, la théorie de la complexité algébrique est l'étude de la complexité algorithmique de problèmes de nature algébrique, concernant des polynômes.Dans cette thèse, nous étudions différents aspects de la complexité algébrique. D'une part, nous nous intéressons à l'expressivité des déterminants de matrices comme représentations des polynômes dans le modèle de complexité de Valiant. Nous montrons que les matrices symétriques ont la même expressivité que les matrices quelconques dès que la caractéristique du corps est différente de deux, mais que ce n'est plus le cas en caractéristique deux. Nous construisons également la représentation la plus compacte connue du permanent par un déterminant. D'autre part, nous étudions la complexité algorithmique de problèmes algébriques. Nous montrons que la détection de racines dans un système de n polynômes homogènes à n variables est NP-difficile. En lien avec la question « VP = VNP ? », version algébrique de « P = NP ? », nous obtenons une borne inférieure pour le calcul du permanent d'une matrice par un circuit arithmétique, et nous exhibons des liens unissant ce problème et celui du test d'identité polynomiale. Enfin nous fournissons des algorithmes efficaces pour la factorisation des polynômes lacunaires à deux variables. / Computational complexity is the study of the resources — time, memory, …— needed to algorithmically solve a problem. Within these settings, algebraic complexity theory is the study of the computational complexity of problems of algebraic nature, concerning polynomials. In this thesis, we study several aspects of algebraic complexity. On the one hand, we are interested in the expressiveness of the determinants of matrices as representations of polynomials in Valiant's model of complexity. We show that symmetric matrices have the same expressiveness as the ordinary matrices as soon as the characteristic of the underlying field in different from two, but that this is not the case anymore in characteristic two. We also build the smallest known representation of the permanent by a determinant.On the other hand, we study the computational complexity of algebraic problems. We show that the detection of roots in a system of n homogeneous polynomials in n variables in NP-hard. In line with the “VP = VNP ?”question, which is the algebraic version of “P = NP?” we obtain a lower bound for the computation of the permanent of a matrix by an arithmetic circuit, and we point out the links between this problem and the polynomial identity testing problem. Finally, we give efficient algorithms for the factorization of lacunary bivariate polynomials.
138

Molekulární analýza rezistenčního genu vga(A)LC - identifikace klíčových aminokyselinových zbytků. / Molecular analysis of resistance gene vga(A)LC identification of key aminoacid residues.

Kroová, Michaela January 2011 (has links)
Protein Vga(A) gives staphylococci resistance to streptogramins A. The recently discovered protein Vga(A)LC differs from Vga(A) only by 7 amino acid residues, but this difference is sufficient for shift of its substrate specificity towards lincosamides. The group of four amino acids in the central part of protein (LGAG in Vga(A) and SVTS in Vga(A)LC) was detected to be crucial for the substrate specificity. In this diploma thesis 5 alternativesets of vga(A)LC gene point mutations were prepared in order to determine the impact of individual amino acids of the aforementioned group on the resistance phenotype. Mutations were prepared in vector pGEM® -T and cloned into shuttle vector pRB374. The prepared constructs were transformed by electroporation into the sensitive strain of Staphylococcus aureus RN4220 and values of minimum inhibitory concentration (MIC) were measured for lincomycin, clindamycin and pristinamycin IIA by the agar dilution method. The transformation was not successful in one of the mutations. Results of setting MIC for the remaining four mutations do not make it possible to specify uniquely the ratio of individual amino acids for determining substrate specificity. Two of the amino acids were found to be important. We anticipate preparation of more mutations.
139

Trajectory and Pulse Optimization for Active Towed Array Sonar using MPC and Information Measures

Ekdahl Filipsson, Fabian January 2020 (has links)
In underwater tracking and surveillance, the active towed array sonar presents a way of discovering and tracking adversarial submerged targets that try to stay hidden. The configuration consist of listening and emitting hydrophones towed behind a ship. Moreover, it has inherent limitations, and the characteristics of sound in the ocean are complex. By varying the pulse form emitted and the trajectory of the ship the measurement accuracy may be improved. This type of optimization constitutes a sensor management problem. In this thesis, a model of the tracking scenario has been constructed derived from Cramér-Rao bound analyses. A model predictive control approach together with information measures have been used to optimize a filter's estimated state of the target. For the simulations, the MATLAB environment has been used. Different combinations of decision horizons, information measures and variations of the Kalman filter have been studied. It has been found that the accuracy of the Extended Kalman filter is too low to give consistent results given the studied information measures. However, the Unscented Kalman filter is sufficient for this purpose.
140

Estimation Problems Related to Random Matrix Ensembles / Schätzprobleme für Ensembles zufälliger Matrizen

Matić, Rada 06 July 2006 (has links)
No description available.

Page generated in 0.1181 seconds