Дисертації з теми "Round and communication complexity"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Round and communication complexity".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Pankratov, Denis. "Communication complexity and information complexity." Thesis, The University of Chicago, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3711791.
Повний текст джерелаInformation complexity enables the use of information-theoretic tools in communication complexity theory. Prior to the results presented in this thesis, information complexity was mainly used for proving lower bounds and direct-sum theorems in the setting of communication complexity. We present three results that demonstrate new connections between information complexity and communication complexity.
In the first contribution we thoroughly study the information complexity of the smallest nontrivial two-party function: the AND function. While computing the communication complexity of AND is trivial, computing its exact information complexity presents a major technical challenge. In overcoming this challenge, we reveal that information complexity gives rise to rich geometrical structures. Our analysis of information complexity relies on new analytic techniques and new characterizations of communication protocols. We also uncover a connection of information complexity to the theory of elliptic partial differential equations. Once we compute the exact information complexity of AND, we can compute exact communication complexity of several related functions on n-bit inputs with some additional technical work. Previous combinatorial and algebraic techniques could only prove bounds of the form Θ( n). Interestingly, this level of precision is typical in the area of information theory, so our result demonstrates that this meta-property of precise bounds carries over to information complexity and in certain cases even to communication complexity. Our result does not only strengthen the lower bound on communication complexity of disjointness by making it more exact, but it also shows that information complexity provides the exact upper bound on communication complexity. In fact, this result is more general and applies to a whole class of communication problems.
In the second contribution, we use self-reduction methods to prove strong lower bounds on the information complexity of two of the most studied functions in the communication complexity literature: Gap Hamming Distance (GHD) and Inner Product mod 2 (IP). In our first result we affirm the conjecture that the information complexity of GHD is linear even under the uniform distribution. This strengthens the Ω(n) bound shown by Kerenidis et al. (2012) and answers an open problem by Chakrabarti et al. (2012). We also prove that the information complexity of IP is arbitrarily close to the trivial upper bound n as the permitted error tends to zero, again strengthening the Ω(n) lower bound proved by Braverman and Weinstein (2011). More importantly, our proofs demonstrate that self-reducibility makes the connection between information complexity and communication complexity lower bounds a two-way connection. Whereas numerous results in the past used information complexity techniques to derive new communication complexity lower bounds, we explore a generic way, in which communication complexity lower bounds imply information complexity lower bounds in a black-box manner.
In the third contribution we consider the roles that private and public randomness play in the definition of information complexity. In communication complexity, private randomness can be trivially simulated by public randomness. Moreover, the communication cost of simulating public randomness with private randomness is well understood due to Newman's theorem (1991). In information complexity, the roles of public and private randomness are reversed: public randomness can be trivially simulated by private randomness. However, the information cost of simulating private randomness with public randomness is not understood. We show that protocols that use only public randomness admit a rather strong compression. In particular, efficient simulation of private randomness by public randomness would imply a version of a direct sum theorem in the setting of communication complexity. This establishes a yet another connection between the two areas. (Abstract shortened by UMI.)
Ada, Anil. "Communication complexity." Thesis, McGill University, 2014. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=121119.
Повний текст джерелаLa complexité de communication étudie combien de bits un groupe de joueurs donné doivent échanger entre eux pour calculer une function dont l'input est distribué parmi les joueurs. Bien que ce soit un domaine de recherche naturel basé sur des considérations pratiques, la motivation principale vient des nombreuses applications théoriques.Cette thèse comporte trois parties principales, étudiant trois aspects de la complexité de communication.1. La première partie discute le modèle 'number on the forehead' (NOF) dans la complexité de communication à plusieurs joueurs. Il s'agit d'un modèle fondamental en complexité de communication, avec des applications à la complexité des circuits, la complexité des preuves, les programmes de branchement et la théorie de Ramsey. Dans ce modèle, nous étudions les fonctions composeés f de g. Ces fonctions comprennent la plupart des fonctions bien connues qui sont étudiées dans la littérature de la complexité de communication. Un objectif majeur est de comprendre quelles combinaisons de f et g produisent des compositions qui sont difficiles du point de vue de la communication. En particulier, à cause de l'importance des applications aux circuits, il est intéressant de comprendre la puissance du modèle NOF quand le nombre de joueurs atteint ou dépasse log n. Motivé par ces objectifs nous montrons l'existence d'un protocole simultané efficace à k joueurs de coût O(log^3 n) pour sym de g lorsque k > 1 + log n, sym est une function symmétrique quelconque et g est une fonction arbitraire. Nous donnons aussi des applications de notre protocole efficace à la théorie de Ramsey.Dans le contexte où k < log n, nous étudions de plus près des fonctions de la forme majority de g, mod_m de g et nor de g, où les deux derniers cas sont des généralisations des fonctions bien connues et très étudiées Inner Product et Disjointness respectivement. Nous caractérisons la complexité de communication de ces fonctions par rapport au choix de g.2. La deuxième partie considère les applications de l'analyse de Fourier des fonctions symmétriques à la complexité de communication et autres domaines. La norme spectrale d'une function booléenne f:{0,1}^n -> {0,1} est la somme des valeurs absolues de ses coefficients de Fourier. Nous donnons une caractérisation combinatoire pour la norme spectrale des fonctions symmétriques. Nous montrons que le logarithme de la norme spectrale est du même ordre de grandeur que r(f)log(n/r(f)), avec r(f) = max(r_0,r_1) où r_0 et r_1 sont les entiers minimaux plus petits que n/2 pour lesquels f(x) ou f(x)parity(x) est constant pour tout x tel que x_1 + ... + x_n à [r_0,n-r_1]. Nous présentons quelques applications aux arbres de décision et à la complexité de communication des fonctions symmétriques.3. La troisième partie étudie la confidentialité dans le contexte de la complexité de communication: quelle quantité d'information est-ce que les joueurs révèlent sur leur input en suivant un protocole donné? L'inatteignabilité de la confidentialité parfaite pour plusieurs fonctions motivent l'étude de la confidentialité approximative. Feigenbaum et al. (Proceedings of the 11th Conference on Electronic Commerce, 167--178, 2010) ont défini des notions de confidentialité approximative dans le pire cas et dans le cas moyen, et ont présenté plusieurs bornes supérieures intéressantes ainsi que quelques questions ouvertes. Dans cette thèse, nous obtenons des bornes asymptotiques précises, pour le pire cas aussi bien que pour le cas moyen, sur l'échange entre la confidentialité approximative de protocoles et le coût de communication pour les enchères Vickrey Auction, qui constituent l'exemple canonique d'une enchère honnête. Nous démontrons aussi des bornes inférieures exponentielles sur la confidentialité approximative de protocoles calculant la function Intersection, indépendamment du coût de communication. Ceci résout une conjecture de Feigenbaum et al.
Chen, Lijie S. M. Massachusetts Institute of Technology. "Fine-grained complexity meets communication complexity." Thesis, Massachusetts Institute of Technology, 2019. https://hdl.handle.net/1721.1/122754.
Повний текст джерелаCataloged from PDF version of thesis.
Includes bibliographical references (pages 215-229).
Fine-grained complexity aims to understand the exact exponent of the running time of fundamental problems in P. Basing on several important conjectures such as Strong Exponential Time Hypothesis (SETH), All-Pair Shortest Path Conjecture, and the 3-Sum Conjecture, tight conditional lower bounds are proved for numerous exact problems from all fields of computer science, showing that many text-book algorithms are in fact optimal. For many natural problems, a fast approximation algorithm would be as important as fast exact algorithms. So it would be interesting to show hardness for approximation algorithms as well. But we had few techniques to prove tight hardness for approximation problems in P--In particular, the celebrated PCP Theorem, which proves similar approximation hardness in the world of NP-completeness, is not fine-grained enough to yield interesting conditional lower bounds for approximation problems in P.
In 2017, a breakthrough work of Abboud, Rubinstein and Williams [12] established a framework called "Distributed PCP", and applied that to show conditional hardness (under SETH) for several fundamental approximation problems in P. The most interesting aspect of their work is a connection between fine-grained complexity and communication complexity, which shows Merlin-Arther communication protocols can be utilized to give fine-grained reductions between exact and approximation problems. In this thesis, we further explore the connection between fine-grained complexity and communication complexity. More specifically, we have two sets of results. In the first set of results, we consider communication protocols other than Merlin-Arther protocols in [12] and show that they can be used to construct other fine-grained reductions between problems. [sigma]₂ Protocols and An Equivalence Class for Orthogonal Vectors (OV).
First, we observe that efficient [sigma]₂[superscripts cc] protocols for a function imply fine-grained reductions from a certain related problem to OV. Together with other techniques including locality-sensitive hashing, we establish an equivalence class for OV with O(log n) dimensions, including Max-IP/Min-IP, approximate Max-IP/Min-IP, and approximate bichromatic closest/further pair. · NP · UPP Protocols and Hardness for Computational Geometry Problems in 2⁰([superscript log*n]) Dimensions. Second, we consider NP · UPP protocols which are the relaxation of Merlin-Arther protocols such that Alice and Bob only need to be convinced with probability > 1/2 instead of > 2/3.
We observe that NP · UPP protocols are closely connected to Z-Max-IP problem in very small dimensions, and show that Z-Max-IP, l₂₋-Furthest Pair and Bichromatic l₂-Closest Pair in 2⁰[superscript (log* n)] dimensions requires n²⁻⁰[superscript (1)] time under SETH, by constructing an efficient NP - UPP protocol for the Set-Disjointness problem. This improves on the previous hardness result for these problems in w(log² log n) dimensions by Williams [172]. · IP Protocols and Hardness for Approximation Problems Under Stronger Conjectures. Third, building on the connection between IP[superscript cc] protocols and a certain alternating product problem observed by Abboud and Rubinstein [11] and the classical IP = PSPACE theorem [123, 155]. We show that several finegrained problems are hard under conjectures much stronger than SETH (e.g., the satisfiability of n⁰[superscript (1)]-depth circuits requires 2(¹⁻⁰[superscript (1)n] time).
In the second set of results, we utilize communication protocols to construct new algorithms. · BQP[superscript cc] Protocols and Approximate Counting Algorithms. Our first connection is that a fast BQP[superscript cc] protocol for a function f implies a fast deterministic additive approximate counting algorithm for a related pair counting problem. Applying known BQP[superscript cc] protocols, we get fast deterministic additive approximate counting algorithms for Count-OV (#OV), Sparse Count-OV and Formula of SYM circuits. · AM[superscript cc]/PH[superscript cc] Protocols and Efficient SAT Algorithms. Our second connection is that a fast AM[superscript cc] (or PH[superscript cc]) protocol for a function f implies a faster-than-bruteforce algorithm for a related problem.
In particular, we show that if the Longest Common Subsequence (LCS) problem admits a fast (computationally efficient) PH[superscript cc] protocol (polylog(n) complexity), then polynomial-size Formula-SAT admits a 2[superscript n-n][superscript 1-[delta]] time algorithm for any constant [delta] > 0, which is conjectured to be unlikely by a recent work of Abboud and Bringmann [6].
by Lijie Chen.
S.M.
S.M. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
Dam, Wim van. "Nonlocality and communication complexity." Thesis, University of Oxford, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.325982.
Повний текст джерелаLerays, Virginie. "Quantum nonlocality and communication complexity." Paris 7, 2014. http://www.theses.fr/2014PA077151.
Повний текст джерелаQuantum computing raises a lot of questions related to the foundations of computing. We study, in this thesis, a complexity model called communication complexity, where we study the amount of communication required to solve a distributed task. We study this model from the perspective of quantum information theory. This thesis introduces a new way of obtaining lower bounds on communication complexity, using ideas developed in the study of quantum nonlocality. These methods are compared to previously known lower-bound methods and allow us to define a new family of Bell inequalities. We also prove in this thesis that ail previously known lower bounds for communication complexity are also lower bounds on information complexity. This witnesses the potential equivalence between these two measures of complexity and allows us to obtain direct sum results on the communication complexity of very-well studied functions
Lacayo, Virginia. "Communicating Complexity: A Complexity Science Approach to Communication for Social Change." Ohio University / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1367522049.
Повний текст джерелаAngus, Simon Douglas Economics Australian School of Business UNSW. "Economic networks: communication, cooperation & complexity." Awarded by:University of New South Wales. Economics, 2007. http://handle.unsw.edu.au/1959.4/27005.
Повний текст джерелаMcGinty, Nigel, and nigel mcginty@defence gov au. "Reduced Complexity Equalization for Data Communication." The Australian National University. Research School of Information Sciences and Engineering, 1998. http://thesis.anu.edu.au./public/adt-ANU20050602.122741.
Повний текст джерелаTesson, Pascal. "An algebraic approach to communication complexity." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0026/MQ50894.pdf.
Повний текст джерелаDhulipala, Anand. "On communication complexity and universal compression." Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2007. http://wwwlib.umi.com/cr/ucsd/fullcit?p3284204.
Повний текст джерелаTitle from first page of PDF file (viewed January 10, 2008). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 93-95).
Tesson, Pascal. "An algebraic approach to communication complexity /." Thesis, McGill University, 1998. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=21653.
Повний текст джерелаThese results lead us to state a conjecture which would generalize Szegedy's theorem to O(1) players. They also suggest several interesting possibilities to further uncover algebraic characterizations of communication complexity classes. (Abstract shortened by UMI.)
Kamath, Pritish. "Communication complexity of permutation-invariant functions." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99861.
Повний текст джерелаCataloged from PDF version of thesis.
Includes bibliographical references (pages 68-71).
Motivated by the quest for a broader understanding of communication complexity of simple functions, we introduce the class of "permutation-invariant" functions. A partial function f : {0, 1}n x {0, 1}n --> {0, 1, ?} is permutation-invariant if for every bijection [pi]: {1,..., n} --> {1,.. ., n} and every x, y [sum] {0, I}n, it is the case that f (x, y) = f (x[pi], y[pi]). Most of the commonly studied functions in communication complexity are permutation-invariant. For such functions, we present a simple complexity measure (computable in time polynomial in n given an implicit description of f) that describes their communication complexity up to polynomial factors and up to an additive error that is logarithmic in the input size. This gives a coarse taxonomy of the communication complexity of simple functions. Our work highlights the role of the well-known lower bounds of functions such as SET-DISJOINTNESS and INDEXING, while complementing them with the relatively lesser-known upper bounds for GAP-INNER-PRODUCT (from the sketching literature) and SPARSE-GAP-INNER-PRODUCT (from the recent work of Canonne et al. [ITCS 2015]). We also present consequences to the study of communication complexity with imperfectly shared randomness where we show that for total permutation-invariant functions, imperfectly shared randomness results in only a polynomial blow-up in communication complexity after an additive O(log log n) loss.
by Pritish Kamath.
S.M. in Computer Science & Engineering
Alvarez, George Francisco Centre of Health Informatics UNSW. "Interruptive communication patterns in the intensive care unit ward round." Awarded by:University of New South Wales. Centre of Health Informatics, 2006. http://handle.unsw.edu.au/1959.4/23430.
Повний текст джерелаHerrmann, Andrew F. "Understanding Complexity in a Polymediated Age." Digital Commons @ East Tennessee State University, 2014. https://dc.etsu.edu/etsu-works/786.
Повний текст джерелаKamat, Angad Mohandas. "Improvements in communication complexity using quantum entanglement." Texas A&M University, 2008. http://hdl.handle.net/1969.1/86008.
Повний текст джерелаFerdinand, N. S. (Nuwan Suresh). "Low complexity lattice codes for communication networks." Doctoral thesis, Oulun yliopisto, 2016. http://urn.fi/urn:isbn:9789526210964.
Повний текст джерелаTiivistelmä Hilakoodit saavuttavat AWGN kapasiteetin ja sopivat luonnollisesti moniin monen päätelaitteen verkkoihin niihin sisältyvän rakenteen vuoksi. Vaikka lukuisat informaatioteoreettiset tutkimustyöt todistavat hilakoodien tärkeyden näille verkoille, käytännössä alhaisen kompleksisuuden hilajärjestelmiä on vielä vähän. Näin ollen tämän tutkielman tarkoitus on kehittää useita metodeja, jotta hilakoodeista saadaan käytännöllisiä viestintäverkkoihin. Aluksi, ehdotamme tehokkaan hilakoodausjärjestelmän reaaliarvoisille, full duplexisille yksi- ja kaksisuuntaisille välittäjäkanaville. Käytämme hilan hajottamista, superpositiota ja lohko-Markov -koodausta ehdottaessamme yksinkertaiset ja siltikin kapasiteetin saavuttavat koodaus- ja dekoodausjärjestelmät näihin välityskanaviin. Käyttämällä informaatioteoreettisia työkaluja, osoitamme näiden järjestelmien saavutettavat nopeudet, jotka ovat yhtä suuret kuin parhaimmat tunnetut nopeudet. Sitten rakennamme käytännölliset ja alhaisen monimutkaisuuden toteutukset ehdotetuille välitysjärjestelmille käyttäen alhaisen tiheyden hilakoodeja. Esitämme näille järjestelmille numeeriset arvioinnit, jotka näyttävät että nämä toteutukset saavuttavat tehokkuuden, joka on 2.5dB:n päässä teoreettisista rajoista. Tutkimme muotoilu- ja koodaushäviön vaikutusta välityskanavien tehokkuuteen. Sitten, ehdotamme alhaisen monimutkaisuuden hilakoodirakenteen, joka tarjoaa korkean muotoilu- ja koodausvahvistuksen. Ensin, kokonaislukuinformaatio on koodattu muotoiltuihin kokonaislukuihin. Esitämme kaksi metodia tähän tehtävään; 'Voronoi kokonaisluvut' ja 'ei yhtenäiset kokonaisluvut'. Näillä muotoilluilla kokonaisluvuilla on muotoiluvahvistusta kokonaislukuhilalle. Toisena askeleena, esitämme yleiset puitteet systemaattiseen kokonaislukujen koodaukseen käyttäen korkeaulotteisia hiloja alhaisen kolmiogeneraattori- tai pariteettivarmistusmatriiseja, jotka säilyttävät samalla muotoiluvahvistuksen. Ehdotettua järjestelmää voidaan käyttää muotoilemaan korkeaulotteisia hiloja kuten alhaisen tiheyden hilakoodeja, LDA-hiloja, jne. Esitämme kattavan analyysin käyttäen alhaisen tiheyden hilakoodeja. Käyttämällä muotoiluhiloina E8aa ja BW16a, näytämme numeerisesti 'Voronoi kokonaislukujen' käyttämisen seurauksena saavutettavat hilojen muotoiluvahvistukset, jotka ovat jopa 0.65dB ja 0.86dB. Näytämme myös numeerisesti että 'ei yhtenäisillä kokonaisluvuilla' on muotoiluvahvistusta jopa 1.25dB. Nämä muotoiluoperaatiot voidaan toteuttaa alhaisemmalla monimutkaisuudella kuin aikaisemmat 'alhaisen tiheyden hilakoodien muotoilumenetelmät' ja muotoiluvahvistukset ovat suuremmat kuin aikaisemmin raportoidut tapaukset, jotka ovat suuruusluokaltaan 0.4dB. Viimeiseksi, ehdotamme käytännöllisen koodikonstruktion alhaisella monimutkaisuudella 'laske ja lähetä' -menetelmään. Kehitämme uuden koodikonstruktion, jota kutsumme 'sekoitetuksi sisäkkäiseksi hilakoodikonstruktioksi'. Tämä koodikonstruktio käyttää kahta eroteltavissa olevaa sisäkkäistä hilaa koodaamaan kokonaisluvut siellä, missä muotoilu tehdään pienen ulottuvuuden hiloilla korkean muotoiluvahvistuksella ja koodaus toteutetaan käyttäen korkean koodausvahvistuksen omaavaa korkeaulottuvuuksista hilaa. Tämä konstruktio säilyttää muotoilu- ja koodausvahvistukset kullekin muotoilu- ja koodaushilalle. Lisäksi, todistamme isomorfismin olemassaolon tässä konstruktiossa siten, että lineaarisen hilakoodien kombinaatio voidaan kuvata lineaarisena kokonaislukujen kombinaationa äärellisessä kunnassa. Näin ollen tätä konstruktiota voidaan helposti käyttää missä tahansa 'laske ja lähetä' -sovelluksessa. Esitämme muokatun LDLC dekooderin lineaarisen viestikombinaation estimointiin. Arvioimme tehon numeerisesti
Baudic, Gwilherm. "Complexity Efficient Decoder Design for Vehicular Communication." Thesis, KTH, Kommunikationsteori, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-124014.
Повний текст джерелаAda, Anil. "Non-deterministic communication complexity of regular languages." Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=112367.
Повний текст джерелаWe show that a regular language has either O(1) or O(log n) non-deterministic complexity. We obtain several linear lower bound results which cover a wide range of regular languages having linear non-deterministic complexity. These lower bound results also imply a result in semigroup theory: we obtain sufficient conditions for not being in the positive variety Pol(Com).
To obtain our results, we use algebraic techniques. In the study of regular languages, the algebraic point of view pioneered by Eilenberg ([Eil74]) has led to many interesting results. Viewing a semigroup as a computational device that recognizes languages has proven to be prolific from both semigroup theory and formal languages perspectives. In this thesis, we provide further instances of such mutualism.
Sun, Yean. "Effective length factors for solid round diagonals in guyed communication towers." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape8/PQDD_0033/MQ62290.pdf.
Повний текст джерелаHahne, Ellen Louise. "Round robin scheduling for fair flow control in data communication networks." Thesis, Massachusetts Institute of Technology, 1986. http://hdl.handle.net/1721.1/14932.
Повний текст джерелаMICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING
Bibliography: leaves 216-218.
by Ellen Louise Hahne.
Ph.D.
Weisenhorn, Martin. "Low-complexity techniques for ultra-wideband communication systems." kostenfrei, 2007. http://mediatum2.ub.tum.de/doc/625801/document.pdf.
Повний текст джерелаLuo, Zhi-Quan. "Communication complexity of some problems in distributed computation." Thesis, Massachusetts Institute of Technology, 1989. http://hdl.handle.net/1721.1/14344.
Повний текст джерелаIncludes bibliographical references (leaves 153-158).
by Zhi-Quan Luo.
Sc.D.
Reed, Delanna. "A Round Peg in a Square Hole: Lesbian Teachers Fitting In." Digital Commons @ East Tennessee State University, 2014. https://dc.etsu.edu/etsu-works/1288.
Повний текст джерелаReed, Delanna. "A Round Peg in a Square Hole: Lesbian Teachers Fitting In." Digital Commons @ East Tennessee State University, 2016. https://dc.etsu.edu/etsu-works/1279.
Повний текст джерелаTasneem, Khawaja Tauseef. "Reduced Complexity Detection Techniques for Multi-Antenna Communication Systems." Thesis, University of Canterbury. Electrical and Computer Engineering, 2013. http://hdl.handle.net/10092/8611.
Повний текст джерелаSteinberg, David Charles. "Why Hollywood lost the Uruguay Round : the political economy of mass communication revisited." Thesis, London School of Economics and Political Science (University of London), 1999. http://etheses.lse.ac.uk/1568/.
Повний текст джерелаKhazan, Roger Igor. "A one-round algorithm for virtually synchronous group communication in wide area networks." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/29235.
Повний текст джерелаIncludes bibliographical references (p. 159-165).
Group communication services, and especially those that implement Virtual Synchrony semantics, are powerful middleware systems that facilitate the development of fault-tolerant distributed applications. In this thesis, we present a high quality, theoretical design of a group communication service that implements Virtual Synchrony semantics and is aimed for deployment in wide-area networks (WANs). The design features a novel algorithm for implementing Virtual Synchrony semantics; the algorithm is more appropriate for WANs than the existing solutions because it involves fewer rounds of communication and operates in a scalable WAN-oriented architecture. The high quality of the design refers to the level of formality and rigor at which it is done: The design includes formal and precise specifications, algorithms, correctness proofs, and performance analyses. We develop the necessary supporting theory and methodology required for producing and evaluating this design. In particular, we develop a formal, inheritance-based, methodology that supports incremental construction of specifications, models, and proofs. This methodology helps us manage the complexity of the design and makes it evident which part of the algorithm implements which property of the system. We also develop new, formal approaches in the area of performance evaluation.
by Roger I. Khazan.
Ph.D.
Bull, David R. "Signal processing techniques with reduced computational complexity." Thesis, Cardiff University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.388006.
Повний текст джерелаLi, Yunxi. "Study of low-complexity modal multiplexing for optical communication links." Thesis, University of Cambridge, 2015. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.708925.
Повний текст джерелаOoi, James M. 1970. "A framework for low-complexity communication over channels with feedback." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/10050.
Повний текст джерелаIncludes bibliographical references (p. 181-185).
by James Meng-Hsien Ooi.
Ph.D.
Al-Askery, Ali Jaber Abdulwahab. "Reduced complexity detection for massive MIMO-OFDM wireless communication systems." Thesis, University of Newcastle upon Tyne, 2017. http://hdl.handle.net/10443/3880.
Повний текст джерелаUrrutia, Florent. "Information theory for multi-party peer-to-peer communication protocols." Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCC015/document.
Повний текст джерелаThis thesis is concerned with the study of multi-party communicationprotocols in the asynchronous message-passing peer-to-peer model. We introducetwo new information measures, the Public Information Complexity(PIC) and the Multi-party Information Complexity (MIC), study their propertiesand how they are related to other fundamental quantities in distributedcomputing such as communication complexity and randomness complexity.We then use these two measures to study the parity function and the disjointness function
Baker, Elise, and A. Lynn Williams. "Complexity Approaches To Intervention." Digital Commons @ East Tennessee State University, 2010. https://dc.etsu.edu/etsu-works/2232.
Повний текст джерелаLallo, Madeline M. "Good Vibrations: Signal Complexity in Schizocosa Ethospecies." University of Cincinnati / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1554215678769319.
Повний текст джерелаWarmke, Daniel A. "Complexity, Fun, and Robots." Ohio University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1565298442450712.
Повний текст джерелаBonnett, John. "Communication, complexity and empire, the systemic thought of Harold Adams Innis." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2002. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/NQ66124.pdf.
Повний текст джерелаMohd, Salleh Lailawati. "The relationship among leadership communication competence, emotional intelligence, and cognitive complexity." Ohio : Ohio University, 2007. http://www.ohiolink.edu/etd/view.cgi?ohiou1173101143.
Повний текст джерелаDai, Xiaoguang, and 戴晓光. "Receiver complexity reduction of multiple-input multiple-output wireless communication systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B46589508.
Повний текст джерелаChan, Albert M. (Albert Michael) 1975. "A framework for low-complexity iterative interference cancellation in communication systems." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/28537.
Повний текст джерелаIncludes bibliographical references (p. 211-215).
Communication over interference channels poses challenges not present for the more traditional additive white Gaussian noise (AWGN) channels. In order to approach the information limits of an interference channel, interference mitigation techniques need to be integrated with channel coding and decoding techniques. This thesis develops such practical schemes when the transmitter has no knowledge of the channel. The interference channel model we use is described by r = Hx + w, where r is the received vector, H is an interference matrix, x is the transmitted vector of data symbols chosen from a finite set, and w is a noise vector. The objective at the receiver is to detect the most likely vector x that was transmitted based on knowledge of r, H, and the statistics of w. Communication contexts in which this general integer programming problem appears include the equalization of intersymbol interference (ISI) channels, the cancellation of multiple-access interference (MAI) in code-division multiple-access (CDMA) systems, and the decoding of multiple-input multiple-output (MIMO) systems in fading environments. We begin by introducing mode-interleaved precoding, a transmitter preceding technique that conditions an interference channel so that the pairwise error probability of any two transmit vectors becomes asymptotically equal to the pairwise error probability of the same vectors over an AWGN channel at the same signal-to-noise ratio (SNR). While mode-interleaved precoding dramatically increases the complexity of exact ML detection, we develop iterated-decision detection to mitigate this complexity problem. Iterated-decision detectors use optimized multipass algorithms to successively cancel interference from r and generate symbol
(cont.) decisions whose reliability increases monotonically with each iteration. When used in uncoded systems with mode-interleaved preceding, iterated-decision detectors asyrmptotically achieve the performance of ML detection (and thus the interference-free lower bound) with considerably lower complexity. We interpret these detectors as low-complexity approximations to message-passing algorithms. The integration of iterated-decision detectors into communication systems with coding is also developed to approach information rates close to theoretical limits. We present joint detection and decoding algorithms based on the iterated-decision detector with mode-interleaved precoding, and also develop analytic tools to predict the behavior of such systems. We discuss the use of binary codes for channels that support low information rates, and multilevel codes and lattice codes for channels that support higher information rates.
by Albert M. Chan.
Ph.D.
Vinyals, Marc. "Space in Proof Complexity." Doctoral thesis, KTH, Teoretisk datalogi, TCS, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-206571.
Повний текст джерелаQC 20170509
Brandeho, Mathieu. "New bounds for information complexity and quantum query complexity via convex optimization tools." Doctoral thesis, Universite Libre de Bruxelles, 2018. https://dipot.ulb.ac.be/dspace/bitstream/2013/277139/4/Main.pdf.
Повний текст джерелаDoctorat en Sciences de l'ingénieur et technologie
info:eu-repo/semantics/nonPublished
Kohl, Lisa Maria [Verfasser], and D. [Akademischer Betreuer] Hofheinz. "On Improving Communication Complexity in Cryptography / Lisa Maria Kohl ; Betreuer: D. Hofheinz." Karlsruhe : KIT-Bibliothek, 2019. http://d-nb.info/1201414814/34.
Повний текст джерелаStader, Sally. "Impacts of Complexity and Timing of Communication Interruptions on Visual Detection Tasks." Doctoral diss., University of Central Florida, 2014. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/6361.
Повний текст джерелаPh.D.
Doctorate
Psychology
Sciences
Psychology; Human Factors Psychology
Mekhitarian, Araxi. "Reducing Software Complexity in a Distributed Publish-Subscribe system using Multicast communication." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-232120.
Повний текст джерелаSystem av distribuerad karaktär ökar i storlek och blir alltmer komplex. Att hantera och anpassa sig till ständiga kravändringar är emellertid en utmaning under hela systemets utvecklingsprocess. Medan nya funktioner implementeras kan mjukvaran ändras i design vilket kan leda till dålig programkvalitet och ökad systemkomplexitet. Denna rapport fokuserar på att hantera komplexiteten i ett distribuerat telekrigföringssystem som används i militära flygplan. Systemet består av en server och flera klienter som publicerar och prenumererar för olika typer av meddelanden som skickas i systemet. Kommunikationen baseras på enkelsändning och använder ett publish/subscribe meddelandemönster där klienterna registrerar sig som publicerare eller prenumeranter till servern. Systemet är skapat för att kunna hantera höga meddelandehastigheter och har låg tolerans för meddelandeförseningar. På grund av detta är tillförlitlighet i nätverksstrukturen ett essentiellt kvalitetsattribut då nätverket är i behov av en ständig utveckling. En prototyp av multisändning kommer att implementeras och ersätta kommunikationen baserad på enkelsändning och publish/subscribe registreringsprocessen till servern. Systemet kommer att utvärderas genom en jämförelse av den gamla kommunikationsversionen av systemet med den nya multicast-implementeringen med hjälp av mjukvarukomplexitetsmätningar. Resultatet är att utvärdera om beteendet och funktionaliteten hos det distribuerade telekrigföringssystemet ändras.
Sjöberg, Frank. "High speed communication on twisted-pair wires and low complexity multiuser detectors." Licentiate thesis, Luleå tekniska universitet, 1998. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-18771.
Повний текст джерелаGodkänd; 1998; 20070404 (ysko)
Mohd, Salleh Lailawati. "Communication Competence of Malaysian Leaders as a Function of Emotional Intelligence and Cognitive Complexity." Ohio University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1173101143.
Повний текст джерелаBoyce, Kelsey Lewis. "Effects of Syntactic Complexity on Speech Motor Performance." BYU ScholarsArchive, 2013. https://scholarsarchive.byu.edu/etd/3417.
Повний текст джерелаOh, Min-seok. "Low complexity bit-level soft-decision decoding for Reed-Solomon codes." Thesis, University of Surrey, 1999. http://epubs.surrey.ac.uk/842687/.
Повний текст джерелаZhou, Li. "Low Complexity PSP-MLSE receiver for H-CPM with receive diversity." Thesis, University of Canterbury. Department of Electrical and Computer Engineering, 2009. http://hdl.handle.net/10092/4455.
Повний текст джерелаKei, Chun-Ling. "Efficient complexity reduction methods for short-frame iterative decoding /." View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202002%20KEI.
Повний текст джерелаIncludes bibliographical references (leaves 86-91). Also available in electronic version. Access restricted to campus users.