Dissertations / Theses on the topic 'Locality'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Locality.'
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.
Ferguson, Matthew T. "Aspects of dynamical locality and locally covariant canonical quantization." Thesis, University of York, 2013. http://etheses.whiterose.ac.uk/4529/.
Full textBasilico, David Anthony. "Quantification and locality." Diss., The University of Arizona, 1993. http://hdl.handle.net/10150/186305.
Full textRazenshteyn, Ilya. "Beyond locality-sensitive hashing." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/89862.
Full textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
32
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 43-45).
We present a new data structure for the c-approximate near neighbor problem (ANN) in the Euclidean space ... This is the first improvement over the result by Andoni and Indyk (FOCS 2006) and the first data structure that bypasses a locality-sensitive hashing lower bound proved by O'Donnell, Wu and Zhou (ICS 2011). By known reductions we obtain a data structure for the Hamming space and ... which is the first improvement over the result of Indyk and Motwani (STOC 1998).
by Ilya Razenshteyn.
S.M. in Computer Science and Engineering
McGinnis, Martha. "Locality in A-movement." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/9650.
Full textIncludes bibliographical references (leaves [219]-229).
In this dissertation, I demonstrate that the feature-based Attract theory of syntactic movement solves several empirical challenges for Relativized Minimality, while incorporating its key insights. Chapter 1 introduces the theory of phrase structure, syntactic movement, and abstract Case to be adopted throughout the dissertation. This chapter also lays out a cross-linguistic typology of possibilities for A-movement to the subject position. Chapter 2 concerns cases of advancing,where the argument generated highest is attracted by the feature (EPP) driving movement to the subject position. Here locality interacts with a condition (Case Identification) preventing an argument from "pied-piping" to check EPP if it checks Case elsewhere. In some instances, advancing is forced jointly by locality and Case Identification. Given two equally local arguments, Case Identification determines which can be attracted to the subject position. However, newly identified "superraising" violations support the view that locality is respected even if the highest argument has already checked Case. In the first part of Chapter 3, I argue for the central empirical proposal of this dissertation, Lethal Ambiguity: an anaphoric dependency cannot be established between two specifiers of the same head. I contend that one argument can A-scramble past another only by entering, or leapfrogging through, a multiple-specifier configuration with it. In either case, no anaphoric dependency can be established between the two arguments. In the second part of Chapter 3, I present cases of leapfrogging in A-movement to the subject position, also subject to Lethal Ambiguity. Chapter 4 extends the empirical coverage of Lethal Ambiguity to answer a long-standing question from the literature-namely, why anaphoric clitics cannot be object clitics, I argue that Lethal Ambiguity rules out the object clitic derivation for anaphors because an anaphoric object checks Case in a multiple-specifier configuration with the would-be antecedent. I adopt a passive-like derivation for the well-formed anaphoric clitic construction, where the clitic is a categorically underspecified external argument. Since this argument cannot be attracted to check Case or EPP, the object can skip over it to the subject position without Lethal Ambiguity arising. The remainder of the chapter is devoted to other potential cases of skipping.
by Martha Jo McGinnis.
Ph.D.
Filippucci, Paola. "Presenting the past in Bassano : locality and localism in a northern Italian town." Thesis, University of Cambridge, 1992. https://www.repository.cam.ac.uk/handle/1810/272950.
Full textFenati, Andrea. "Data Locality in Serverless Computing." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/20401/.
Full textPironio, Stefano. "Aspects of quantum non-locality." Doctoral thesis, Universite Libre de Bruxelles, 2004. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/211151.
Full textNous commençons par un examen de la structure des corrélations locales et non-locales. Nous dérivons dans ce contexte de nouvelles inégalités de Bell, et généralisons ensuite le paradoxe de Greenberger-Horne-Zelinger à des états quantiques de dimension arbitraire et composés de plusieurs sous-systèmes.
Nous abordons par après la non-localité du point de vue de la théorie de l'information. Il est possible de concevoir des théories non-locales consistantes avec le principe de causalité mais offrant des avantages supérieurs à la mécanique quantique en terme de manipulation de l'information. Nous investiguons l'ensemble des corrélations compatibles avec de telles théories afin d'éclairer l'origine des limitations imposées par le formalisme quantique. Nous nous intéressons également à la quantité de communication classique nécessaire pour simuler les corrélations non-locales. Nous montrons que cette mesure naturelle de la non-localité est étroitement liée au degré de violations des inégalités de Bell.
Nous nous tournons ensuite vers des aspects expérimentaux. La faible efficacité des détecteurs utilisés dans les expériences de violation des inégalités de Bell reste un obstacle majeur à une démonstration convaincante de la non-localité, mais aussi à toute utilisation de la non-localité dans des protocoles d'information quantique. Nous dérivons d'une part des bornes quant à l'efficacité minimale requise pour violer les inégalités de Bell, et d'autre part des exemples de corrélations plus résistante à ces imperfections expérimentales.
Finalement, nous clôturons cette thèse en montrant comment la non-localité, principalement étudiée dans le cadre de systèmes décrits par des variables discrètes, telles que les variables de spin, peut également se manifester dans des systèmes à variables continues, telles que les variables de position et d'impulsion.
Doctorat en sciences, Spécialisation physique
info:eu-repo/semantics/nonPublished
Greenfield, D. L. "Rentian locality in chip multiprocessors." Thesis, University of Cambridge, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.599668.
Full textCollins, Daniel G. "Perspectives on quantum non-locality." Thesis, University of Bristol, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.247668.
Full textRoberts, David. "Aspects of quantum non-locality." Thesis, University of Bristol, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.404082.
Full textPatel-Grosz, Pritty. "(Anti-)locality at the interfaces." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/77803.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (p. 173-179).
This dissertation investigates the constraints on referential dependency relations that can hold between epithets and their antecedents under c-command. The initial observation, presented here in (1), is that epithets can be c-commanded by an antecedent, as long as it is not the closest c-commanding element. (1) a. * Nero, thinks that [the damn traitor] will be invited to the reception. b. OK Nero, thinks that they2 will invite [the damn traitor] to the reception. C.?OK John convinced the panel2 that [the idiot], is smart. Upon closer inspection, the difference between (la) and (lb) seems to involve a subject-object asymmetry in the complement clause of think. Similarly, the contrast between (la) and (lc) suggests that the matrix predicate plays a part in the reduced acceptability of (la). The first part of this dissertation (chapter 2) concerns the syntax of epithets. I argue that epithets are null pronouns modified by a nominal appositive. This argument is based two core pieces of evidence: (i) I will present cross-linguistic evidence illustrating that epithets can be syntactically bound by a quantifier (ii) a series of diagnostics from Den Dikken (2001) and Kayne (2005). Chapter 3 and 4 of this thesis address the semantics of epithets. Following Potts (2005), I argue that epithets must be evaluated from the perspective of a given individual, the evaluator. In chapter 3, I argue that the difference between thinks and convince (cf. Stephenson (2007)) reflects constraints on the judge parameter in an embedded clause that contains an epithet. In chapter 4, I refine my proposal in the spirit of Percus and Sauerland (2003a), (2003b), and argue that cases in which the judge parameter is shifted to the matrix subject have the property of selecting a de se LF. I argue that epithets that adjoin inside such a de se LF cannot refer to the attitude holder, as the nominal appositive would have to adjoin to an uninterpreted anchor. I derive the (la)-(lb) difference by arguing that epithets can undergo LF movement from a position within the embedded object to the antecedent in the matrix clause, but not from a position in the embedded subject. Chapter 5 concludes with a discussion of the role of epithets for general theories of locality.
by Pritty Patel-Grosz.
Ph.D.
Singh, Raj Ph D. Massachusetts Institute of Technology. "Modularity and locality in interpretation." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/45895.
Full textIncludes bibliographical references (p. 177-185).
This thesis will argue for four broad claims: (1) That local contexts are needed for a descriptively adequate theory of linguistic interpretation, (2) That presupposition accommodation is made with respect to a set of grammatically defined candidates, (3) That the set of accommodation candidates is derived from the same linguistic objects that are used to derive candidates for implicature (the scalar alternatives of the asserted sentence), (4) That scalar implicatures and accommodated propositions are the output of Fox's [31] procedure of innocent exclusion, modified so as to consider implicature candidates and accommodation candidates together. I argue for claim (1) in Chapter 2 by arguing that Heim's principle of Maximize Presupposition! should be checked in local contexts (Local MP). In Chapter 3, I use Local MP to account for an array of blocking effects. We will see that Local MP can help to shed light on the semantics of only, counterfactual conditionals, and focus interpretation, as well as highlighting the importance of dynamically changing assignment functions in a theory of interpretation. I argue for claims (2)-(4) in Chapters 4 and 5 by attempting to address the proviso problem (Geurts [43]), as well as a new puzzle for the theory of implicature that arises in the study of attitude ascriptions.
by Raj Singh.
Ph.D.
Leung, Shun-Tak Albert. "Array restructuring for cache locality /." Thesis, Connect to this title online; UW restricted, 1996. http://hdl.handle.net/1773/7023.
Full textJula, Alin Narcis. "Improving locality with dynamic memory allocation." [College Station, Tex. : Texas A&M University, 2008. http://hdl.handle.net/1969.1/ETD-TAMU-2910.
Full textSánchez, Navarro Francisco Jesús. "Smart memory management through locality analysis." Doctoral thesis, Universitat Politècnica de Catalunya, 2001. http://hdl.handle.net/10803/5965.
Full textHemos desarrollado un análisis estático de localidad de datos. Este análisis está basado en los vectores de reuso y contiene los tres típicos pasos: reuso, volumen y análisis de interferencias. Comparado con trabajos previos, tanto el análisis de volúmenes como el de interferencias ha sido mejorado utilizando información de profiling así como un análisis de interferencias más preciso. El analizador de localidad de datos propuesto ha sido incluido como un paso más en un compilador de investigación. Los resultados demuestran que, para aplicaciones numéricas, el análisis es muy preciso y el overhead de cálculo es bajo. Este análisis es la base para todas las otras partes de la tesis. Además, para algunas propuestas en la última parte de la tesis, hemos usado un análisis de localidad de datos basado en las ecuaciones de fallos de cache. Este análisis, aunque requiere más tiempo de cálculo, es más preciso y más apropiado para cachés asociativas por conjuntos. El uso de dos análisis de localidad diferentes también demuestra que las propuestas arquitectónicas de esta tesis son independientes del análisis de localidad particular utilizado.
Después de mostrar la precisión del análisis, lo hemos utilizado para estudiar el comportamiento de localidad exhibido por los programas SPECfp95. Este tipo de análisis es necesario antes de proponer alguna nueva técnica ya que ayuda al investigador a entender porqué ocurren los fallos de caché. Se muestra que con el análisis propuesto se puede estudiar de forma muy precisa la localidad de un programa y detectar donde estan los "puntos negros" así como la razón de estos fallos en cache. Este estudio del comportamiento de localidad de diferentes programas es la base y motivación para las diferentes técnicas propuestas en esta tesis para mejorar el rendimiento de la memoria.
Así, usando el análisis de localidad de datos y basándonos en los resultados obtenidos después de analizar el comportamiento de localidad de un conjunto de programas, proponemos utilizar este análisis con el objetivo de guiar tres técnicas diferentes: (i) manejo de caches multimódulo, (ii) prebúsqueda software para bucles con planificación módulo, y (iii) planificación de instrucciones de arquitecturas VLIW clusterizadas.
El primer uso del análisis de localidad propuesto es el manejo de una novedosa organización de caché. Esta caché soporta bypass y/o está compuesta por diferentes módulos, cada uno orientado a explotar un tipo particular de localidad. La mayor diferencia de esta caché con respecto propuestas previas es que la decisión de "cachear" o no, o en qué módulo un nuevo bloque es almacenado, está controlado por algunos bits en las instrucciones de memoria ("pistas" de localidad). Estas "pistas" (hints) son fijadas en tiempo de compilación utilizando el análisis de localidad propuesto. Así, la complejidad del manejo de esta caché se mantiene bajo ya que no requiere ningún hardware adicional. Los resultados demuestran que cachés más pequeñas con un manejo más inteligente pueden funcionar tan bien (o mejor) que cachés convencionales más grandes.
Hemos utilizado también el análisis de localidad para estudiar la interacción entre la segmentación software y la prebúsqueda software. La segmentación software es una técnica muy efectiva para la planificación de código en bucles (principalmente en aplicaciones numéricas en procesadores VLIW). El esquema más popular de prebúsqueda software se llama planificación módulo. Muchos trabajos sobre planificación módulo se pueden encontrar en la literatura, pero casi todos ellos consideran una suposición crítica: consideran un comportamiento optimista de la cache (en otras palabras, usan siempre la latencia de acierto cuando planifican instrucciones de memoria). Así, los resultados que presentan ignoran los efectos del bloqueo debido a dependencias con instrucciones de memoria. En esta parte de la tesis mostramos que esta suposición puede llevar a planificaciones cuyo rendimiento es bastante más bajo cuando se considera una memoria real. Nosotros proponemos un algoritmo para planificar instrucciones de memoria en bucles con planificación módulo. Hemos estudiado diferentes estrategias de prebúsqueda software y finalmente hemos propuesto un algoritmo que realiza prebúsqueda basándose en el análisis de localidad y en la forma del grafo de dependencias del bucle. Los resultados obtenidos demuestran que el esquema propuesto mejora el rendimiento de las otras heurísticas ya que obtiene un mejor compromiso entre tiempo de cálculo y de bloqueo.
Finalmente, el último uso del análisis de localidad estudiado en esta tesis es para guiar un planificador de instrucciones para arquitecturas VLIW clusterizadas. Las arquitecturas clusterizadas están siendo una tendencia común en el diseño de procesadores empotrados/DSP. Típicamente, el núcleo de estos procesadores está basado en un diseño VLIW el cual particiona tanto el banco de registros como las unidades funcionales. En este trabajo vamos un paso más allá y también hacemos la partición de la memoria caché. En este caso, tanto las comunicaciones entre registros como entre memorias han de ser consideradas. Nosotros proponemos un algoritmo que realiza la partición del grafo así como la planificación de instrucciones en un único paso en lugar de hacerlo secuencialmente, lo cual se demuestra que es más efectivo. Este algoritmo es mejorado añadiendo una análisis basado en las ecuaciones de fallos de cache con el objetivo de guiar en la planificación de las instrucciones de memoria para reducir no solo comunicaciones entre registros, sino también fallos de cache.
Cache memories were incorporated in microprocessors in the early times and represent the most common
solution to deal with the gap between processor and memory speeds. However, many studies point out that the cache storage capacity is wasted many times, which means a direct impact in processor performance. Although a cache is designed to exploit different types of locality, all memory references are handled in the same way, ignoring particular locality behaviors. The restricted use of the locality information for each memory access can limit the effectivity of the cache. In this thesis we show how a data locality analysis can help the researcher to understand where and why cache misses occur, and then to propose different techniques that make use of this information in order to improve the performance of cache memory. We propose techniques in which locality information obtained by the locality analyzer is passed from the compiler to the hardware through the ISA to guide the management of memory accesses.
We have developed a static data locality analysis. This analysis is based on reuse vectors and performs the three typical steps: reuse, volume and interfere analysis. Compared with previous works, both volume
and interference analysis have been improved by using profile information as well as a more precise inter-
ference analysis. The proposed data locality analyzer has been inserted as another pass in a research compiler. Results show that for numerical applications the analysis is very accurate and the computing overhead is low. This analysis is the base for all other parts of the thesis. In addition, for some proposals in the last part of the thesis we have used a data locality analysis based on cache miss equations. This analysis, although more time consuming, is more accurate and more appropriate for set-associative caches. The usage of two different locality analyzers also shows that the architectural proposals of this thesis are independent from the particular locality analysis.
After showing the accuracy of the analysis, we have used it to study the locality behavior exhibited by the SPECfp95 programs. This kind of analysis is necessary before proposing any new technique since can help the researcher to understand why cache misses occur. We show that with the proposed analysis we can study very accurately the locality of a program and detect where the hot spots are as well as the reason for these misses. This study of the locality behavior of different programs is the base and motivation for the different techniques proposed in this thesis to improve the memory performance.
Thus, using the data locality analysis and based on the results obtained after analyzing the locality behavior of a set of programs, we propose to use this analysis in order to guide three different techniques: (i) management of multi-module caches, (ii) software prefetching for modulo scheduled loops, and (iii) instruction scheduling for clustered VLIW architectures.
The first use of the proposed data locality analysis is to manage a novel cache organization. This cache supports bypassing and/or is composed of different modules, each one oriented to exploit a particular type of locality. The main difference of this cache with respect to previous proposals is that the decision of caching or not, or in which module a new fetched block is allocated is managed by some bits in memory instructions (locality hints). These hints are set at compile time using the proposed locality analysis. Thus, the management complexity of this cache is kept low since no additional hardware is required. Results show that smaller caches with a smart management can perform as well as (or better than) bigger conventional caches.
We have also used the locality analysis to study the interaction between software pipelining and software prefetching. Software pipelining has been shown to be a very effective scheduling technique for loops (mainly in numerical applications for VLIW processors). The most popular scheme for software pipelining is called modulo scheduling. Many works on modulo scheduling can be found in the literature, but almost all of them make a critical assumption: they consider an optimistic behavior of the cache (in other words, they use the hit latency when a memory instruction is scheduled). Thus, the results they present ignore the effect of stalls due to dependences with memory instructions. In this part of the thesis we show that this assumption can lead to schedules whose performance is rather low when a real memory is considered. Thus, we propose an algorithm to schedule memory instructions in modulo scheduled loops. We have studied different software prefetching strategies and finally proposed an algorithm that performs prefetching based on the locality analysis and the shape of the loop dependence graph. Results obtained shows that the proposed scheme outperforms other heuristic approaches since it achieves a better trade-off between compute and stall time than the others. Finally, the last use of the locality analysis studied in this thesis is to guide an instruction scheduler for a clustered VLIW architecture. Clustered architectures are becoming a common trend in the design of embedded/DSP processors. Typically, the core of these processors is based on a VLIW design which partitionates both register file and functional units. In this work we go a step beyond and also make a partition of the cache memory. Then, both inter-register and inter-memory communications have to be taken into account. We propose an algorithm that performs both graph partition and instruction scheduling in a single step instead of doing it sequentially, which is shown to be more effective. This algorithm is improved by adding an analysis based on the cache miss equations in order to guide the scheduling of memory instructions in clusters with the aim of reducing not only inter-register communications, but also cache misses.
Muddukrishna, Ananya. "Exploiting locality in OpenMP task scheduling." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-26318.
Full textWallin, Dan. "Exploiting data locality in adaptive architectures." Licentiate thesis, Uppsala universitet, Avdelningen för datorteknik, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-86160.
Full textPrunet, Jean-François. "Spreading and locality domains in phonology." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74017.
Full textAllcock, Jonathan. "Quantum non-locality and quantum communication." Thesis, University of Bristol, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.521062.
Full textEdwards, William. "Non-locality in Categorical Quantum Mechanics." Thesis, University of Oxford, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.525298.
Full textKotzoglou, Georgios. "Wh-extraction and locality in Greek." Thesis, University of Reading, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.424030.
Full textQuinlan, K. M. "Utilising spatial locality in solid modelling." Thesis, University of Bath, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356386.
Full textFritz, Christopher. "Aspects of non-locality in gravity." Thesis, University of Sussex, 2018. http://sro.sussex.ac.uk/id/eprint/79185/.
Full textFutrell, Richard Landy Jones. "Memory and locality in natural language." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/114075.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (pages 189-211).
I explore the hypothesis that the universal properties of human languages can be explained in terms of efficient communication given fixed human information processing constraints. I argue that under short-term memory constraints, optimal languages should exhibit information locality: words that depend on each other, both in their interpretation and in their statistical distribution, should be close to each other in linear order. The informationtheoretic approach to natural language motivates a study of quantitative syntax in Chapter 2, focusing on word order flexibility. In Chapter 3, I show comprehensive corpus evidence from over 40 languages that word order in grammar and usage is shaped by working memory constraints in the form of dependency locality: a pressure for syntactically linked words to be close. In Chapter 4, I develop a new formal model of language processing cost, called noisy-context surprisal, based on rational inference over noisy memory representations. This model unifies surprisal and memory effects and derives dependency locality effects as a subset of information locality effects. I show that the new processing model also resolves a long-standing paradox in the psycholinguistic literature, structural forgetting, where the effects of memory appear to be language-dependent. In the conclusion I discuss connections to probabilistic grammars, endocentricity, duality of patterning, incremental planning, and deep reinforcement learning.
by Richard Landy Jones Futrell.
Ph. D. in Cognitive Science
Kishore, Shaunak. "Accelerated clustering through locality-sensitive hashing." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/77534.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (p. 18).
We obtain improved running times for two algorithms for clustering data: the expectation-maximization (EM) algorithm and Lloyd's algorithm. The EM algorithm is a heuristic for finding a mixture of k normal distributions in Rd that maximizes the probability of drawing n given data points. Lloyd's algorithm is a special case of this algorithm in which the covariance matrix of each normally-distributed component is required to be the identity. We consider versions of these algorithms where the number of mixture components is inferred by assuming a Dirichlet process as a generative model. The separation probability of this process, [alpha], is typically a small constant. We speed up each iteration of the EM algorithm from O(nd2k) to O(ndk log 3(k/a))+nd 2 ) time and each iteration of Lloyd's algorithm from O(ndk) to O(nd(k/a). 39) time.
by Shaunak Kishore.
S.B.
M.Eng.
Verguson, Christine Jane. "'Opting out'? : nation, region and locality." Thesis, University of Huddersfield, 2014. http://eprints.hud.ac.uk/id/eprint/23523/.
Full textYan, Yong. "Exploiting cache locality at run-time." W&M ScholarWorks, 1998. https://scholarworks.wm.edu/etd/1539623938.
Full textHunter, Andrew. "Locality and Complexity in Path Search." Scholarship @ Claremont, 2009. https://scholarship.claremont.edu/hmc_theses/220.
Full textLi, Dongdong. "Inter-core locality aware memory access scheduling." Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/52650.
Full textApplied Science, Faculty of
Electrical and Computer Engineering, Department of
Graduate
Bodine, Jill T. "Exploiting Computational Locality in Global Value Histories." NCSU, 2002. http://www.lib.ncsu.edu/theses/available/etd-05122002-121743/.
Full textHarrison, Ian. "Locality and parallel optimizations for parallel supercomputing." Diss., Connect to the thesis, 2003. http://hdl.handle.net/10066/1274.
Full textWallin, Dan. "Methods for Creating and Exploiting Data Locality." Doctoral thesis, Uppsala : Acta Universitatis Upsaliensis : Universitetsbiblioteket [distributör], 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-6837.
Full textKrishnamoorthy, Sriram. "Optimizing locality and parallelism through program reorganization." Columbus, Ohio : Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1197913392.
Full textGafos, Adamantios I. "The articulatory basis of locality in phonology /." New York, NY [u.a.] : Garland, 1999. http://www.loc.gov/catdir/enhancements/fy0652/99019876-d.html.
Full textBarrett, J. "Entanglement, non-locality and quantum information theory." Thesis, University of Cambridge, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596412.
Full textMovahhedian, Hossein. "Locality, Lorentz invariance and the Bohm model." Thesis, Durham University, 1998. http://etheses.dur.ac.uk/4829/.
Full textWeinberg, Amy S. "Locality principles in syntax and in parsing." Thesis, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/14486.
Full textM.I.T. copy lacks leaves 67, 105, 106, 107, 204, 206, 209, 218, 240, 241, and 245. Vita.
Includes bibliographical references (leaves 296-306).
by Amy Sara Weinberg.
Ph.D.
Doggett, Teal Bissell 1975. "All things being unequal : locality in movement." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/28837.
Full textIncludes bibliographical references (p. 155-158).
In this thesis I demonstrate that a simplified theory of locality \ has greater success in accounting for locality in movement than more complicated alternatives that have been suggested. In particular, I argue that closeness should not be relativized to minimal domains, and that locality in movement follows from restrictions on Agree, but not on Move itself. Data is drawn from Locative Inversion in English, passivization in ditransitive verb phrases and constructions which involve movement to multiple specifiers of a single head. I show that the constructions that have previously been claimed to necessitate the notion of equidistance do not in fact provide motivation for this concept. Instead, further investigation of these constructions actually provides evidence for the elimination of equidistance from the grammar. I further argue that movement past a existing specifier to a higher specifier of the same head is grammatical, and that data which has been argued to show that this movement is prohibited can be given another analysis. This follows if Move, in contrast to Agree, is not subject to locality constraints. The streamlined theory of locality proposed here therefore ultimately accounts for a wider body of data than any of the more complicated alternatives.
by Teal Bissell Doggett.
Ph.D.
Hodkin, Malcolm. "The pursuit of locality in quantum mechanics." Thesis, University of St Andrews, 1990. http://hdl.handle.net/10023/8786.
Full textPARRA, Eulises Alejandro Fonseca. "A proposal to quantify quantum non-locality." Universidade Federal de Pernambuco, 2014. https://repositorio.ufpe.br/handle/123456789/17178.
Full textMade available in DSpace on 2016-06-29T11:57:33Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) template.pdf: 1023711 bytes, checksum: bb469b82eb53b63f6e13f942f61ae867 (MD5) Previous issue date: 2014-08-14
CNPq
As fun c~oes de Bell s~ao conhecidas pelo papel central desempenhado na caracteriza c~ao da n~ao localidade da teoria qu^antica. Usualmente s~ao empregadas na quanti ca c~ao do grau de n~ao localidade de sistemas qu^anticos espec cos atrav es do calculo do seu valor m aximo entre todos os poss veis estados e con gura c~oes associadas aos detectores. No entanto, embora dois estados qu^anticos tenham diferentes \densidades de con gura c~ao n~ao local"( Estados com diferentes contribui c~oes de con gura c~oes associadas aos detectores que geram n~ao localidade), se eles possuem o mesmo valor do m aximo da fun c~ao de Bell, ent~ao s~ao considerados igualmente n~ao locais. Usando este crit erio, Ac n et al. (Phys. Rev. A 65, 052325, 2002) encontraram que para qunits (Estados de sistemas qu^anticos conjuntos d-dimensionais), o estado maximamente emaranhado n~ao corresponde ao estado maximamente n~ao local, fato que e considerado como uma anomalia da n~ao localidade da teoria qu^antica (M ethot & Scarani; Quant. Inf. Comput. 7, 157, 2008). A m de resolver o problema da anomalia, nesta disserta c~ao e proposta uma medida do grau de n~ao localidade, na qual s~ao tomadas em conta todas as contribui c~oes de con- gura c~oes dos detectores que geram n~ao localidade do estado. Tal medida e proporcional a integral da fun c~ao de Bell na regi~ao de viola c~ao, no espa co dos par^ametros que caracterizam as con gura c~oes (Em geral ^angulos relativos entre orienta c~oes dos detectores). Foi calculado o grau de n~ao localidade de v arios sistemas de dois e tr^es n veis, com e sem uma contribui c~ao de ru do qu^antico ao estado, usando tr^es tipos de desigualdades de Bell: A desigualdade na vers~ao original, a desigualdade CHSH e a desigualdade GCLMP (Ac n et al. 2002). Em todos os casos estudados foi observada concond^ancia entre o estado maximamente emaranhado e o estado maximamente n~ao local, resolvendo assim o problema da anomalia da n~ao localidade.
Bell functions are known by the central role played on the characterization of non-locality in quantum theory. They are often used in the quanti cation of the non-locality strength for speci c quantum systems by calculating their maximum among all possible states and detector's con gurations. However, even if two quantum states present di erent \nonlocal density con gurations"(States with di erent contributions of detector con gurations that generate non-locality), if these display the same value for the maximum of Bell function, then they are considered equally non-local. Making use of this criteria, Ac n et al. (Phys. Rev. A 65, 052325, 2002) found that for qunits (Joint states of d-dimensional quantum systems), the maximally entangled state does not match with the maximally non-local state, this is known as an anomaly of quantum non-locality (M ethot & Scarani; Quant. Inf. Comput. 7, 157, 2008). In order to solve the anomaly problem, in this dissertation it is proposed a nonlocality strength measure in which the whole contributions of detector's con gurations that give rise to non-locality are taken into account. Such a measure is proportional to the Bell function integration over the violation region on the space of the parameters that characterize the detector's con guration (Usually, relative angles between orientations of detectors). The non-locality strength was calculated for several two and three-level bipartite systems, with and without a contribution of white noise to the whole state of the system, by using three kinds of Bell inequalities: Bell inequality in its original version, CHSH inequality and GCLMP inequality (Ac n et al. 2002). In all the cases, it was observed agreement between maximally entangled states and maximally non-local ones, thus solving the problem of anomaly of non-locality.
Rajbhandari, Samyam. "Locality Optimizations for Regular and Irregular Applications." The Ohio State University, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=osu1469033289.
Full textSeaton, Thomas. "Locality in the evolutionary optimisation of programs." Thesis, University of York, 2013. http://etheses.whiterose.ac.uk/3939/.
Full textJackson, Frances Drew. "Titanosaur reproductive biology comparison of the Auca Mahuevo Titanosaur nesting locality (Argentina), to the Pinyes Megaloolithus nesting locality (Spain) /." Diss., Montana State University, 2007. http://etd.lib.montana.edu/etd/2007/jackson/JacksonF0507.pdf.
Full textTörnqvist, Christian. "Evaluating the Importance of Disk-locality for Data Analytics Workloads : Evaluating the Importance of Disk-locality for Data Analytics Workloads." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-410212.
Full textSorenson, Elizabeth Schreiner. "Cache Characterization and Performance Studies Using Locality Surfaces." BYU ScholarsArchive, 2005. https://scholarsarchive.byu.edu/etd/603.
Full textVicari, Elias. "On locality and related problems : communicating, computing, exploring /." Zürich : ETH, 2008. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=17937.
Full textSorenson, Elizabeth S. "Cache characterization and performance studies using locality surfaces /." Diss., CLICK HERE for online access, 2005. http://contentdm.lib.byu.edu/ETD/image/etd950.pdf.
Full textMurguia, Elixabete. "Syntactic identity and locality restrictions on verbal ellipsis." College Park, Md. : University of Maryland, 2004. http://hdl.handle.net/1903/1439.
Full textThesis research directed by: Linguistics. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
Rogers, Timothy Glenn. "Locality and scheduling in the massively multithreaded era." Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/54916.
Full textApplied Science, Faculty of
Electrical and Computer Engineering, Department of
Graduate
Berg, Erik. "Methods for run time analysis of data locality." Licentiate thesis, Uppsala universitet, Avdelningen för datorteknik, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-86155.
Full text