198,815 research outputs found
Fake News-Emotionally High, Factually Low; India's Urgent Need for Cyberlaw
No full textDespite the growth in the digitalization of India, the fellow netizens still lack digital literacy when it comes to using social media platforms. There are many ways where social media platforms have been used to perform activities in cyberspace which has resulted in causing harm to any person or any property. Fake News is such an important issue on the social media platform which needs to be assessed on a priority basis. Despite various awareness advertisements, programs, and AI-based fact-checkers the netizens still fail to stop the spread of fake news. Various Social Media Platforms have also developed features to bring awareness among the users for spotting fake news but the menace is still out there. However, there is no legislation governing Fake news in India that can punish the culprits. This paper lays down the base on which Indian lawmakers need to focus on the urgency of preparing Cyber Laws for punishing the culprits which could eventually bring down the spreading of fake news
An optimal quantum algorithm for the oracle identification problem
No full textIn the oracle identification problem, we are given oracle access to an unknown N-bit string x promised to belong to a known set C of size M and our task is to identify x. We present a quantum algorithm for the problem that is optimal in its dependence on N and M. Our algorithm considerably simplifies and improves the previous best algorithm due to Ambainis et al. Our algorithm also has applications in quantum learning theory, where it improves the complexity of exact learning with membership queries, resolving a conjecture of Hunziker et al.
The algorithm is based on ideas from classical learning theory and a new composition theorem for solutions of the filtered gamma_2-norm semidefinite program, which characterizes quantum query complexity. Our composition theorem is quite general and allows us to compose quantum algorithms with input-dependent query complexities without incurring a logarithmic overhead for error reduction. As an application of the composition theorem, we remove all log factors from the best known quantum algorithm for Boolean matrix multiplication
Quantum query complexity of minor-closed graph properties
No full textWe study the quantum query complexity of minor-closed graph properties, which include such problems as determining whether an -vertex graph is planar, is a forest, or does not contain a path of a given length. We show that most minor-closed properties -- those that cannot be characterized by a finite set of forbidden subgraphs -- have quantum query complexity Theta(n^(3/2)). To establish this, we prove an adversary lower bound using a detailed analysis of the structure of minor-closed properties with respect to forbidden topological minors and forbidden subgraphs. On the other hand, we show that minor-closed properties (and more generally, sparse graph properties) that can be characterized by finitely many forbidden subgraphs can be solved strictly faster, in o(n^(3/2)) queries. Our algorithms are a novel application of the quantum walk search framework and give improved upper bounds for several subgraph-finding problems
Recommended from our members
Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich’s PRG
No full textIn this work, we establish lower-bounds against memory bounded algorithms for distinguishing between natural pairs of related distributions from samples that arrive in a streaming setting.
Our first result applies to the problem of distinguishing the uniform distribution on {0,1}ⁿ from uniform distribution on some unknown linear subspace of {0,1}ⁿ. As a specific corollary, we show that any algorithm that distinguishes between uniform distribution on {0,1}ⁿ and uniform distribution on an n/2-dimensional linear subspace of {0,1}ⁿ with non-negligible advantage needs 2^Ω(n) samples or Ω(n²) memory (tight up to constants in the exponent).
Our second result applies to distinguishing outputs of Goldreich’s local pseudorandom generator from the uniform distribution on the output domain. Specifically, Goldreich’s pseudorandom generator G fixes a predicate P:{0,1}^k → {0,1} and a collection of subsets S₁, S₂, …, S_m ⊆ [n] of size k. For any seed x ∈ {0,1}ⁿ, it outputs P(x_S₁), P(x_S₂), …, P(x_{S_m}) where x_{S_i} is the projection of x to the coordinates in S_i. We prove that whenever P is t-resilient (all non-zero Fourier coefficients of (-1)^P are of degree t or higher), then no algorithm, with < n^ε memory, can distinguish the output of G from the uniform distribution on {0,1}^m with a large inverse polynomial advantage, for stretch m ≤ (n/t) ^{(1-ε)/36 ⋅ t} (barring some restrictions on k). The lower bound holds in the streaming model where at each time step i, S_i ⊆ [n] is a randomly chosen (ordered) subset of size k and the distinguisher sees either P(x_{S_i}) or a uniformly random bit along with S_i.
An important implication of our second result is the security of Goldreich’s generator with super linear stretch (in the streaming model), against memory-bounded adversaries, whenever the predicate P satisfies the necessary condition of t-resiliency identified in various prior works.
Our proof builds on the recently developed machinery for proving time-space trade-offs (Raz 2016 and follow-ups). Our key technical contribution is to adapt this machinery to work for distinguishing problems in contrast to prior works on similar results for search/learning problems
Dr. Duane M. Jackson, Morehouse College, July 2011
No full textThis video is a conversation with Dr. Duane M. Jackson. Dr. Jackson talks about his paper, "Recall and the Serial Position Effect: The Role of Primacy and Recency on Accounting Students' Performance." Jackie Daniel, AUC Woodruff Library, is the interviewer
"Reflections on the subject of Emigration from Europe with a view to Settlement in the United States" By M. Carey.
No full text"Reflections on the subject of Emigration from Europe with a view to Settlement in the United States: containing bried sketches of the moral and political character of those states.
By M. Carey, member of the American philosophical, and of the American Antiquarian Society, and author of The Olive Branch, Cindiciae Hibernicae, essays on banking, on political economy, and on internal improvement.
To which are now added the English editor's comments on the subject; together with Important Advice to Emigrants, and Cautions Against Impositions Practiced in the Outports
Dispelling the Myths Behind First-author Citation Counts
No full textWe 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
Dr. Glendon Swarthout
No full textHosted by Roger M. Busfield, MSU Assistant Professor of Speech and Theater, Meet the Author is designed to introduce a general audience to a contemporary author and their work through in-depth interviews. This episode features a conversation between Dr. Glendon Swarthout, prolific author and English professor at MSU, and assistant professors Sam S. Baskett and Theodore B. Strandness
- …
