97,184 research outputs found
Trade-Offs Between Entanglement and Communication
No full textWe study the advantages of quantum communication models over classical communication models that are equipped with a limited number of qubits of entanglement. In this direction, we give explicit partial functions on n bits for which reducing the entanglement increases the classical communication complexity exponentially. Our separations are as follows. For every k ≥ ~1:
Q‖^* versus R2^*: We show that quantum simultaneous protocols with Θ̃(k⁵log³n) qubits of entanglement can exponentially outperform two-way randomized protocols with O(k) qubits of entanglement. This resolves an open problem from [Dmitry Gavinsky, 2008] and improves the state-of-the-art separations between quantum simultaneous protocols with entanglement and two-way randomized protocols without entanglement [Gavinsky, 2019; Girish et al., 2022].
R‖^* versus Q‖^*: We show that classical simultaneous protocols with Θ̃(k log n) qubits of entanglement can exponentially outperform quantum simultaneous protocols with O(k) qubits of entanglement, resolving an open question from [Gavinsky et al., 2006; Gavinsky, 2019]. The best result prior to our work was a relational separation against protocols without entanglement [Gavinsky et al., 2006].
R‖^* versus R1^*: We show that classical simultaneous protocols with Θ̃(k log n) qubits of entanglement can exponentially outperform randomized one-way protocols with O(k) qubits of entanglement. Prior to our work, only a relational separation was known [Dmitry Gavinsky, 2008]
Constructing tree decompositions of graphs with bounded gonality
No full textIn this paper, we give a constructive proof of the fact that the treewidth of a graph is at most its divisorial gonality. The proof gives a polynomial time algorithm to construct a tree decomposition of width at most k, when an effective divisor of degree k that reaches all vertices is given. We also give a similar result for two related notions: stable divisorial gonality and stable gonality.Accepted author manuscriptDiscrete Mathematics and Optimizatio
Lower Bounds for XOR of Forrelations
No full textThe Forrelation problem, first introduced by Aaronson [Scott Aaronson, 2010] and Aaronson and Ambainis [Scott Aaronson and Andris Ambainis, 2015], is a well studied computational problem in the context of separating quantum and classical computational models. Variants of this problem were used to give tight separations between quantum and classical query complexity [Scott Aaronson and Andris Ambainis, 2015]; the first separation between poly-logarithmic quantum query complexity and bounded-depth circuits of super-polynomial size, a result that also implied an oracle separation of the classes BQP and PH [Ran Raz and Avishay Tal, 2019]; and improved separations between quantum and classical communication complexity [Uma Girish et al., 2021]. In all these separations, the lower bound for the classical model only holds when the advantage of the protocol (over a random guess) is more than ≈ 1/√N, that is, the success probability is larger than ≈ 1/2 + 1/√N. This is unavoidable as ≈ 1/√N is the correlation between two coordinates of an input that is sampled from the Forrelation distribution, and hence there are simple classical protocols that achieve advantage ≈ 1/√N, in all these models.
To achieve separations when the classical protocol has smaller advantage, we study in this work the xor of k independent copies of (a variant of) the Forrelation function (where k≪ N). We prove a very general result that shows that any family of Boolean functions that is closed under restrictions, whose Fourier mass at level 2k is bounded by α^k (that is, the sum of the absolute values of all Fourier coefficients at level 2k is bounded by α^k), cannot compute the xor of k independent copies of the Forrelation function with advantage better than O((α^k)/(N^{k/2})). This is a strengthening of a result of [Eshan Chattopadhyay et al., 2019], that gave a similar statement for k = 1, using the technique of [Ran Raz and Avishay Tal, 2019]. We give several applications of our result. In particular, we obtain the following separations:
Quantum versus Classical Communication Complexity. We give the first example of a partial Boolean function that can be computed by a simultaneous-message quantum protocol with communication complexity polylog(N) (where Alice and Bob also share polylog(N) EPR pairs), and such that, any classical randomized protocol of communication complexity at most õ(N^{1/4}), with any number of rounds, has quasipolynomially small advantage over a random guess. Previously, only separations where the classical protocol has polynomially small advantage were known between these models [Dmitry Gavinsky, 2016; Uma Girish et al., 2021].
Quantum Query Complexity versus Bounded Depth Circuits. We give the first example of a partial Boolean function that has a quantum query algorithm with query complexity polylog(N), and such that, any constant-depth circuit of quasipolynomial size has quasipolynomially small advantage over a random guess. Previously, only separations where the constant-depth circuit has polynomially small advantage were known [Ran Raz and Avishay Tal, 2019]
Synopsis of shoulder surgery/ [edited by] Uma Srikumaran
No full textIncludes bibliographical references and index"Shoulder problems comprise a significant percentage of orthopaedic practice, including trauma and sports related injuries. Synopsis of Shoulder Surgery by Uma Srikumaran and esteemed contributors provides a concise, well-rounded perspective on the surgical and nonsurgical management of a wide array of shoulder disorders. The opening chapters lay a solid foundation of knowledge, covering anatomy, physical examination of the shoulder, surgical approaches to the shoulder, imaging, and the use of diagnostic and therapeutic injections. Subsequent chapters succinctly discuss management of a comprehensive range of shoulder conditions, organized by the underlying type of pathology. The final chapters provide insightful pearls on shoulder rehabilitation and perioperative pain management"--Shoulder Anatomy / Nickolas G. Garbis -- Complications in Shoulder Arthroscopy / Clayton Alexander and Uma Srikumaran -- Surgical Approaches to the Shoulder / Nickolas G. Garbis and Diana Zhu -- Shoulder-Spine Syndrome / Scott Wagner and Kelly G. Kilcoyne -- Shoulder Imaging / Joseph Ferraro and Matthew Binkley -- Ultrasound of the Shoulder / Paul S. Ragusa and Uma Srikumaran -- Diagnostic and Therapeutic Injections / Suresh K. Nayar and Uma Srikumaran -- Rotator Cuff Disease / Ankit Bansal and Uma Srikumaran -- Arthroscopic Rotator Cuff Repair : Single-Row, Double-Row, and Transosseous-Equivalent Repair / Paul S. Ragusa, Ankit Bansal, and Uma Srikumaran -- Rotator Cuff Reconstruction / Ankit Bansal and Uma Srikumaran -- Frozen Shoulder / Matthew Baker and Uma Srikumaran -- Anterior Shoulder Instability / Alexander E. Loeb and Uma Srikumaran -- Posterior Shoulder Instability / Alexander E. Loeb and Uma Srikumaran -- Shoulder Stabilization Procedures / Eric G. Huish Jr and Uma Srikumaran -- Osteoarthritis / Matthew Binkley and Joseph Ferraro -- Total Shoulder Arthroplasty / Matthew Baker and Uma Srikumaran -- Reverse Total Shoulder Arthroplasty / Matthew Baker and Uma Srikumaran -- Clavicle Fracture / Matthew Baker and Uma Srikumaran -- Proximal Humeral Fractures / Diana Zhu and Uma Srikumaran -- Scapular Winging / Andrew Schneider and Uma Srikumaran -- Thoracic Outlet Syndrome / Alexander Bitzer and Uma Srikumaran -- Perioperative Pain Management for Shoulder Surgery / Ian S. Patten and Uma Srikumaran1 online resource (xv, 200 pages
Ergonomic facilities in special education school / Uma Mageswary K. Munusamy
No full textThis study is about the identification of ergonomic facilities provided in
different types of special schools through questionnaire instrument and observation
during the school survey visit. These schools are of students with vision disability,
hearing deficiency and learning disability. The facilities provided in the Special
Education School are not exactly the same as the normal schools. Thus it has to be
given attention while providing ergonomic facilities in order to serve the student’s need
respectively. There were different categories of ergonomic facility provided around all
these special education schools in terms of classroom condition, lighting, ventilation,
furniture, library and other basic necessity. This research project also involves the
evaluation of the importance for providing ergonomic facilities in the Special Education
School from the perceptive of school management, teachers and non-academic staff.
The facilities provided in the Special Education Schools should not only be safe but also
help the students to improve the potential and carry out their daily activity without any
difficulties.
Keywords: Disability, Ergonomics, Facilities, Special Education Schoo
Supramolecular interactions in high molecular weight bisdithiocarbamate adducts of divalent Zn(II), Cd(II), and Hg(II): spectral, VBS, and single crystal X-ray structural studies on MS4N2 chromophores
No full textThis article describes supramolecular interactions induced in a high molecular weight dithiocarbamate, padtc, by its design. Synthesis, spectral studies involving zinc, cadmium and mercury, padtc, and adducts with tmed, such as [Zn(padtc)2] (1), [Zn(padtc)2(tmed)] center dot C6H5CH3 center dot 0.5(H2O) (2), [Cd(padtc)2] (3), [Cd(padtc)2(tmed)] center dot C6H5CH3 center dot 0.36(H2O) (4), [Hg(padtc)2] center dot H2O (5), [Hg(padtc)2(2,2'-bipy)] center dot H2O (6), [Hg(padtc)2(1,10-phen)] center dot H2O (7), and [Hg(padtc)2(oxine)] center dot H2O (8) (where padtc- = N,N'-(iminodiethylene)bisphthalimidedithiocarbamate, 1,10-phen = 1,10-phenanthroline, tmed = tetramethylethylenediamine, 2,2'-bipy = 2,2'-bipyridine, oxine = 8-hydroxyquinoline) along with the single crystal X-ray structural analysis of [Zn(padtc)2(tmed)] center dot C6H5CH3 center dot 0.5(H2O) (2) and [Cd(padtc)2(tmed)] center dot C6H5CH3 center dot 0.36(H2O) (4) are reported. All the complexes were characterized by IR, NMR (1H and 13C), and thermogravimetric study. The IR spectra of the complexes show the contribution of the thioureide form to the structures. In 13C NMR spectra, the most important thioureide (N13CS2) carbon signals are observed at 210-212 ppm. Single crystal X-ray structural analyses of 2 and 4 show the presence of extensive supramolecular interactions stabilizing the solid-state structure. Both zinc and cadmium are in a distorted octahedral environment with MS4N2 chromophores. VBS of Zn and Cd are 1.76 and 1.98, respectively, supporting the correctness of the determined structure and the valence of the central metal ions
ADMINISTRAÇÃO UNIVERSITÁRIA: EM BUSCA DE UMA EPISTEMOLOGIA
No full textO presente trabalho tem por objetivo realizar uma análise epistemológica de alguns trabalhos relacionados à Administração Universitária. Para tanto, foram selecionados textos referentes às últimas cinco décadas, os quais foram analisados em ordem cronológica. Estes textos foram escolhidos de forma intencional, levando-se em consideração principalmente a abrangência e a importância nacional e internacional (fazer parte de um evento internacional ligado a um organismo internacional, por exemplo). A partir da leitura destes fez-se a análise, partindo-se do pressuposto que a epistemologia da Administração Universitária converge com a epistemologia da Administração, podendo ser considerada inclusive um sub-campo desta. Conclui-se que se faz necessário um repensar crítico das teorias administrativas que dê conta de toda complexidade inerente a todas as organizações, incluindo aí as universidades
Trabalho em equipe: uma estratégia de gestão
No full textTCC (especialização). Universidade Federal de Santa Catarina. Secretaria de Estado da Saúde de Santa Catarina. Gerência de Especialização e Projetos Especiais. Curso de Especialização em Gestão HospitalarRealizamos esta monografia tendo como objetivo atender a exigência do Curso de Especialização em Gestão Hospitalar, para recebermos o título de especialista. A escolha do tema Trabalho em Equipe, passa pela crença de que todos somos sujeitos e construímos a história. Esta história também é construída nas organizações de trabalho. As organizações são construídas pelos seus sujeitos, porém a gestão pode inibir ou viabilizar a participação. Esta participação pode se dar como uma estratégia de gestão através do Trabalho em Equipe. Atuamos na Associação Santa Catarina de Reabilitação unidade assistencial da Secretaria do Estado da Saúde no período de maio de 1997 à setembro de 1998 no Setor de Neurologia Infantil e no período de maio de 1997 à outubro de 1998 nos Setores de Zeladoria e Manutenção, nos quais nos foi possibilitado o estudo através da observação participante. Este estudo visa identificar os fatores, as possibilidades, limites, influências internas e externas, do trabalho em equipe; relatar e analisar a experiência vivenciada; sugerir uma política de gestão hospitalar voltada para o desenvolvimento de trabalhos em equipe, através da implantação de uma assessoria interna. O estudo apresenta no primeiro capítulo As Atuais Tendências de Gestão, no segundo capítulo, considerações sobre Trabalho em Equipe, no Terceiro capítulo, o relato da experiência. Concluímos com uma análise teórico- pratica da experiência e apresentamos nossas sugestões
O entorno vário e fragmentado em K. – Relato de uma busca, de Bernardo Kucinski
No full textO presente ensaio tem como objetivo discutir a multiplicidade de vozes e gêneros textuais presentes no romance de Bernardo Kucinski. Para tal, esta leitura se vale da noção de cronista que Walter Benjamin traz, ou seja, de que tal figura não deesconsidera os acontecimentos: estes, grandes ou pequenos, entrariam na fatura narrada. De modo análogo, a leitura aqui empreendida considera que o protagonista de K. – relato de uma busca usa de expediente semelhante ao atentar para as mais diversas narrativas (acerca do desaparecimento da filha) que lhe chegam, o que o permite engendrar uma narrativa mais holística frente a um contexto propositalmente lacunar, fragmentado.</jats:p
Is Untrusted Randomness Helpful?
No full textRandomized algorithms and protocols assume the availability of a perfect source of randomness. In real life, however, perfect randomness is rare and is almost never guaranteed. The gap between these two facts motivated much of the work on randomness and derandomization in theoretical computer science.
In this work, we define a new type of randomized algorithms (and protocols), that we call robustly-randomized algorithms (protocols). Such algorithms have access to two separate (read-once) random strings. The first string is trusted to be perfectly random, but its length is bounded by some parameter k = k(n) (where n is the length of the input). We think of k as relatively small, say sub-linear or poly-logarithmic in n. The second string is of unbounded length and is assumed to be random, but its randomness is not trusted.
The output of the algorithm is either an output in the set of possible outputs of the problem, or a special symbol, interpreted as do not know and denoted by ⊥. On every input for the algorithm, the output of the algorithm must satisfy the following two requirements:
1) If the second random string is perfectly random then the algorithm must output the correct answer with high probability.
2) If the second random string is an arbitrary string, even adversarially chosen after seeing the input, the algorithm must output with high probability either the correct answer or the special symbol ⊥.
We discuss relations of this new definition to several previously studied notions in randomness and derandomization. For example, when considering polynomial-time algorithms, if k is logarithmic we get the complexity class ZPP, while if k is unbounded we get the complexity class BPP, and for a general k, the algorithm can be viewed as an interactive proof with a probabilistic polynomial-time prover and a probabilistic polynomial-time verifier, where the prover is allowed an unlimited number of random bits and the verifier is limited to at most k random bits.
Every previously-studied class of randomized algorithms or protocols, and more generally, every previous use of randomness in theoretical computer science, can be revisited and redefined in light of our new definition, by replacing each random string with a pair of random strings, the first is trusted to be perfectly random but is relatively short and the second is of unlimited length but its randomness is not trusted. The main question that we ask is: In which settings and for which problems is the untrusted random string helpful?
Our main technical observation is that every problem in the class BPL (of problems solvable by bounded-error randomized logspace algorithms) can be solved by a robustly-randomized logspace algorithm with k = O(log n), that is with just a logarithmic number of trusted random bits. We also give query complexity separations that show cases where the untrusted random string is provenly helpful. Specifically, we show that there are promise problems that can be solved by robustly-randomized protocols with only one query and just a logarithmic number of trusted random bits, whereas any randomized protocol requires either a linear number of random bits or an exponential number of queries, and any zero-error randomized protocol requires a polynomial number of queries
- …
