324,052 research outputs found
One-Way Communication Complexity and Non-Adaptive Decision Trees
Get PDFWe study the relationship between various one-way communication complexity measures of a composed function with the analogous decision tree complexity of the outer function. We consider two gadgets: the AND function on 2 inputs, and the Inner Product on a constant number of inputs. More generally, we show the following when the gadget is Inner Product on 2b input bits for all b ≥ 2, denoted IP.
- If f is a total Boolean function that depends on all of its n input bits, then the bounded-error one-way quantum communication complexity of f∘IP equals Ω(n(b-1)).
- If f is a partial Boolean function, then the deterministic one-way communication complexity of f∘IP is at least Ω(b ⋅ _{dt}^ → (f)), where _{dt}^ → (f) denotes non-adaptive decision tree complexity of f. To prove our quantum lower bound, we first show a lower bound on the VC-dimension of f∘IP. We then appeal to a result of Klauck [STOC'00], which immediately yields our quantum lower bound. Our deterministic lower bound relies on a combinatorial result independently proven by Ahlswede and Khachatrian [Adv. Appl. Math.'98], and Frankl and Tokushige [Comb.'99].
It is known due to a result of Montanaro and Osborne [arXiv'09] that the deterministic one-way communication complexity of f∘XOR equals the non-adaptive parity decision tree complexity of f. In contrast, we show the following when the inner gadget is the AND function on 2 input bits.
- There exists a function for which even the quantum non-adaptive AND decision tree complexity of f is exponentially large in the deterministic one-way communication complexity of f∘AND.
- However, for symmetric functions f, the non-adaptive AND decision tree complexity of f is at most quadratic in the (even two-way) communication complexity of f∘AND. In view of the first bullet, a lower bound on non-adaptive AND decision tree complexity of f does not lift to a lower bound on one-way communication complexity of f∘AND. The proof of the first bullet above uses the well-studied Odd-Max-Bit function. For the second bullet, we first observe a connection between the one-way communication complexity of f and the Möbius sparsity of f, and then give a lower bound on the Möbius sparsity of symmetric functions. An upper bound on the non-adaptive AND decision tree complexity of symmetric functions follows implicitly from prior work on combinatorial group testing; for the sake of completeness, we include a proof of this result.
It is well known that the rank of the communication matrix of a function F is an upper bound on its deterministic one-way communication complexity. This bound is known to be tight for some F. However, in our final result we show that this is not the case when F = f∘AND. More precisely we show that for all f, the deterministic one-way communication complexity of F = f∘AND is at most (rank(M_{F}))(1 - Ω(1)), where M_{F} denotes the communication matrix of F
Diffusive author(s), cohesive author: Analysis of S/N (1994)
No full textThis study indicates the ways in which various aspects of the author(s) are brought forth in Dumb type’s performance art, the S/N production. Previous research has suggested a non-hierarchical organization of Dumb type and the absence of a “privileged author” in Dumb type’s collaborative work, S/N. However, the results that I have investigated from member’s interviews on the creative process of S/N along with my analysis of the recorded images of S/N, indicate a different aspect of the author(s). First, S/N was created through, so to speak, the collective ideas of the members of Dumb type. Further, S/N has at least nine quotations from previous performances, installations, and printed writings, besides the work-in-progress technique. Explicating one of the “author functions” as given by Michel Foucault, each text has plural subjects of the author. However, it has been revealed from members’ interviews that Teiji Furuhashi had a decision-making role in selecting the members’ ideas within the performance. Since then, S/N has had plural subjects of creation; however, Furuhashi is one of the subjects of creation along with the “privileged author.” S/N has plural authors (diffusive authors) yet at the same time, it has a “privileged author,” Teiji Furuhashi (cohesive author)
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Seaweed minerals: unlocking functional food potential from an Indian perspective
No full textAbstract Minerals and trace elements are thought to be necessary for human nutrition, and seaweeds are well known for their accumulation capacity and the rate may vary based on the locations. Green seaweeds are recognized for their iron and magnesium content, whilst brown and red seaweeds prefer to accumulate manganese, iodine, sodium, potassium, and zinc. These properties provide significant opportunities for the functional food development industry to create new ingredients and generate employment. Additionally, certain seaweeds are considered as potential candidates for addressing the iodine deficiency through regular consumption, thus seaweeds hold great potential as functional foods. This review examines the role of minerals in seaweed farming followed by their impact on seaweed growth and nutritional value, the health benefits of mineral-enriched seaweed, and its market potential as a functional food. It also discusses about the limitations, challenges, pathways for popularization, and future opportunities for seaweed as a functional food. Author name: Please confirm if the author names are presented accurately and in the correct sequence (given name, middle name/initial, family name). Author 1 Given name: [S. Shek Mohamed] Last name [Ibrahim]. Author 2 Given name: [R. Suhail] Last name [Haq]. Author 3 Given name: [S. Dinesh] Last name [Kumar]. Also, kindly confirm the details in the metadata are correct. The author's given name modified accordingly. Graphical Abstrac
Lifting to Parity Decision Trees Via Stifling
Get PDFWe show that the deterministic decision tree complexity of a (partial)
function or relation lifts to the deterministic parity decision tree (PDT)
size complexity of the composed function/relation as long as the
gadget satisfies a property that we call stifling. We observe that several
simple gadgets of constant size, like Indexing on 3 input bits, Inner Product
on 4 input bits, Majority on 3 input bits and random functions, satisfy this
property. It can be shown that existing randomized communication lifting
theorems ([G\"{o}\"{o}s, Pitassi, Watson. SICOMP'20], [Chattopadhyay et al.
SICOMP'21]) imply PDT-size lifting. However there are two shortcomings of this
approach: first they lift randomized decision tree complexity of , which
could be exponentially smaller than its deterministic counterpart when either
is a partial function or even a total search problem. Second, the size of
the gadgets in such lifting theorems are as large as logarithmic in the size of
the input to . Reducing the gadget size to a constant is an important open
problem at the frontier of current research.
Our result shows that even a random constant-size gadget does enable lifting
to PDT size. Further, it also yields the first systematic way of turning lower
bounds on the width of tree-like resolution proofs of the unsatisfiability of
constant-width CNF formulas to lower bounds on the size of tree-like proofs in
the resolution with parity system, i.e., (), of the
unsatisfiability of closely related constant-width CNF formulas
Dispelling the Myths Behind First-author Citation Counts
Get PDFWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
Author's address:
No full textCan archives of audiovisual TV interviews be used to make authors more visible to students, and thereby reduce the learning gap between native and non-native language speakers in college classes? We examined students in a college course who learned about one scholar's ideas through watching an audiovisual TV interview (i.e., visible author format) and about another scholar's ideas through reading a formal text description (i.e., invisible author format). For the invisible author, native language speakers scored significantly higher than the non-native language speakers on a corresponding exam question (i.e., a cognitive measure), generated more words on the exam question (i.e., a motivational measure), and mentioned the author's name more often in answering the exam question (i.e., an affective measure). For the visible author, the groups did not differ on any of these measures. These findings provide evidence for the idea that making the author visible through audiovisual TV interviews can eliminate the learning gap between native and non-native language speakers. 3 Universities around the world serve students who are non-native speakers of th
The vanishing author in computer-generated works: a critical analysis of recent Australian case law
Get PDFAbstract
The use of software is ubiquitous in the creation of many copyright works, yet the requirement in copyright law that every work have a human author who engages in independent intellectual effort means that its use may prevent copyright subsistence. Several recent Australian cases have refocused attention on authorship as an essential criterion of copyright subsistence, and these cases suggest that much computer-produced output may be authorless and thus lack copyright protection. This article, the first in a two-part series, analyses how each case deals with the question of authorship of computer-produced works and why the use of software diminishes copyright protection for a significant number of computer-generated works. The article critiques the application of conventional notions of human authorship developed in the pre-computer age to modern productions and suggests alternative approaches to authorship that satisfy both the major objectives of copyright policy and the need to adapt to the computer age. The article argues that, without a broader judicial approach to authorship of computer-generated works, Parliament must remedy the lacuna in protection for these ‘authorless’ works. Possible solutions for reform are suggested. In a forthcoming article, the author comprehensively examines those reform proposals
- …
