190,220 research outputs found
Improved Composition Theorems for Functions and Relations
No full textOne of the central problems in complexity theory is to prove super-logarithmic depth bounds for circuits computing a problem in P, i.e., to prove that P is not contained in NC^1. As an approach for this question, Karchmer, Raz and Wigderson [Mauricio Karchmer et al., 1995] proposed a conjecture called the KRW conjecture, which if true, would imply that P is not cotained in NC^{1}.
Since proving this conjecture is currently considered an extremely difficult problem, previous works by Edmonds, Impagliazzo, Rudich and Sgall [Edmonds et al., 2001], Håstad and Wigderson [Johan Håstad and Avi Wigderson, 1990] and Gavinsky, Meir, Weinstein and Wigderson [Dmitry Gavinsky et al., 2014] considered weaker variants of the conjecture. In this work we significantly improve the parameters in these variants, achieving almost tight lower bounds
Fixed point results for -Meir-Keeler contractive and --Meir-Keeler contractive mappings
No full textIn this paper, first we introduce the notion of a -Meir-Keeler contractive mapping and establish some fixed point theorems for the -Meir-Keeler contractive mapping in the setting of -metric
spaces. Further, we introduce the notion of a -Meir-Keeler contractive mapping in the setting of -cone metric spaces and
obtain a fixed point result. Later, we introduce the notion of a --Meir-Keeler contractive mapping and prove some fixed point theorems for this class of mappings in the setting of
-metric spaces
Intellectual Property and the Audiovisual Industries
No full textThis introduction frames intellectual property (IP) as the foundational concept underpinning the audiovisual industries, encompassing legal, economic, cultural, and creative dimensions. The authors argue that IP has been essential to the distribution and monetization of films and television since the inception of cinema, continuing through the massification of television and into the contemporary era marked by video-on-demand platforms and generative artificial intelligence.
The issue builds upon recent scholarship examining franchise production, remaking practices, and streaming platforms across Hollywood, European, and global contexts. Current debates are driven by concerns over American streaming platforms' control of IP ownership and uncertainties surrounding AI's use of existing IP and creation of new audiovisual works. These tensions have manifested in high-profile strikes by American guilds and aggressive lobbying efforts for EU directives protecting creative workers, though political responses face challenges due to slow legislative timelines and the low priority afforded to audiovisual policy.
The introduction explores contemporary IP management through narrative repurposing practices—including reboots, requels, and legacyquels—that rejuvenate franchises while maintaining affective connections to legacy content. It examines how IPs function as modular, extendible assets managed through multi-layered storytelling mechanisms that differentiate audiences based on familiarity levels, transforming fan knowledge into cultural capital.
The collected articles analyze IP from multiple perspectives: legal and authorship challenges posed by generative AI, streaming platform strategies at Paramount+ and Netflix, piracy and fair use, fan editing practices, transnational circulation of Italian television drama, and South Korean industry practices that prioritize IP protection over human wellbeing. Together, these contributions demonstrate IP's position as the central commodity in contemporary media industries, with implications that will only grow in significance
Universal decoders for channels with memory
No full textCaption title.Includes bibliographical references (p. 14-15).Meir Feder and Amos Lapidoth
Does Economic Optimisation Explain LAI and Leaf Trait Distributions Across an Amazon Soil Moisture Gradient?
No full textModel outputs presented in Flack-Prain, S., Meir, P., Malhi, Y., Smallman, T. L., & Williams, M. (2020).Does Economic Optimisation Explain LAI and Leaf Trait Distributions Across an Amazon Soil Moisture Gradient?. Global Change Biology
Patient’s postoperative Kaplan-Meir survival curves in conventional and piggyback groups (p = 0.32).
No full text<p>Patient’s postoperative Kaplan-Meir survival curves in conventional and piggyback groups (p = 0.32).</p
Meir Kucinski e o conto-arquivo da Shoah/Meir Kucinski and the Shoah's archive tale
No full textNeste artigo, analisam-se os contos "A prédica", "Mitzves, boas ações" e "O tio" presentes na parte intitulada "Ecos do Holocausto", da coletânea Imigrantes, mascates & doutores, de Meir Kucinski (1904, Polônia-1976). Nesses textos, a memória de um mundo que foi, para sempre, deixado em ruínas – destruído pela violência, pela intolerância e pelos desatinos do poder – impõe aos perseguidos os males da ausência, mas também, os novos ares do mundo novo – articulado e rearticulado na ficção, não sem ironia ou sem estratégias de entrar e sair de outras culturas e tradições. In this article, the short stories "A predica", "Mitzves, boa ações" and "O tio" present in the part entitled "Ecos do Holocausto", from the collection Imigrantes, peddlers & doctors, by Meir Kucinski (1904, Poland-1976). In these texts, the memory of a world that was forever left in ruins – destroyed by violence, intolerance and the madness of power – imposes on the persecuted the evils of absence, but also the new air of the new world – articulated and rearticulated in fiction, not without irony or without strategies of entering and leaving other cultures and traditions
Tapiero (Meir). Les Dix Paroles
No full textAzria Régine. Tapiero (Meir). Les Dix Paroles. In: Archives de sciences sociales des religions, n°92, 1995. L'islam en europe. p. 170
Comparison Graphs: A Unified Method for Uniformity Testing
No full textDistribution testing can be described as follows: q samples are being drawn from some unknown distribution P over a known domain [n]. After the sampling process, a decision must be made about whether P holds some property, or is far from it. The most studied problem in the field is arguably uniformity testing, where one needs to distinguish the case that P is uniform over [n] from the case that P is ε-far from being uniform (in ₁). It is known that for this task Θ(√n/ε²) samples are necessary and sufficient. This problem was recently considered in various restricted models that pose, for example, communication or memory constraints. In more than one occasion, the known optimal solution boils down to counting collisions among the drawn samples (each two samples that have the same value add one to the count). This idea dates back to the first uniformity tester, and was coined the name "collision-based tester".
In this paper, we introduce the notion of comparison graphs and use it to formally define a generalized collision-based tester. Roughly speaking, the edges of the graph indicate the tester which pairs of samples should be compared (that is, the original tester is induced by a clique, where all pairs are being compared). We prove a structural theorem that gives a sufficient condition for a comparison graph to induce a good uniformity tester. As an application, we develop a generic method to test uniformity, and devise nearly-optimal uniformity testers under various computational constraints. We improve and simplify a few known results, and introduce a new constrained model in which the method also produces an efficient tester.
The idea behind our method is to translate computational constraints of a certain model to ones on the comparison graph, which paves the way to finding a good graph: a set of comparisons allowed by the model that suffice to test for uniformity. We believe that in future consideration of uniformity testing in new models, our method can be used to obtain efficient testers with minimal effort
- …
