MétaCan
Menu
Back to cohort
Record W3213745603

Faster Big-Data Analysis

2018· preprint· en· W3213745603 on OpenAlexaboutno aff
George Rajna

Bibliographic record

VenueviXra · 2018
Typepreprint
Languageen
FieldDecision Sciences
TopicScientific Computing and Data Management
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceQubitQuantum computerQuantumIBMQuantum technologyPhysicsNanotechnologyMaterials scienceOpen quantum systemQuantum mechanics
DOInot available

Abstract

fetched live from OpenAlex

A research team at Korea's Daegu Gyeongbuk Institute of Science and Technology (DGIST) succeeded in analyzing big data up to 1,000 times faster than existing technology by using GPU-based 'GMiner' technology. [19] A team of researchers with members from IBM Research-Zurich and RWTH Aachen University has announced the development of a new PCM (phase change memory) design that offers miniaturized memory cell volume down to three nanometers. [18] Monatomic glassy antimony might be used as a new type of single-element phase change memory. [17] Physicists have designed a 3-D quantum memory that addresses the tradeoff between achieving long storage times and fast readout times, while at the same time maintaining a compact form. [16] Quantum memories are devices that can store quantum information for a later time, which are usually implemented by storing and re-emitting photons with certain quantum states. [15] The researchers engineered diamond strings that can be tuned to quiet a qubit's environment and improve memory from tens to several hundred nanoseconds, enough time to do many operations on a quantum chip. [14] Intel has announced the design and fabrication of a 49-qubit superconducting quantum-processor chip at the Consumer Electronics Show in Las Vegas. To improve our understanding of the so-called quantum properties of materials, scientists at the TU Delft investigated thin slices of SrIrO3, a material that belongs to the family of complex oxides. [12] New research carried out by CQT researchers suggest that standard protocols that measure the dimensions of quantum systems may return incorrect numbers. [11] Is entanglement really necessary for describing the physical world, or is it possible to have some post-quantum theory without entanglement? [10] A trio of scientists who defied Einstein by proving the nonlocal nature of quantum entanglement will be honoured with the John Stewart Bell Prize from the University of Toronto (U of T). [9] While physicists are continually looking for ways to unify the theory of relativity, which describes large-scale phenomena, with quantum theory, which describes small-scale phenomena, computer scientists are searching for technologies to build the quantum computer using Quantum Information. In August 2013, the achievement of fully deterministic quantum teleportation, using a hybrid technique, was reported. On 29 May 2014, scientists announced a reliable way of transferring data by quantum teleportation. Quantum teleportation of data had been done before but with highly unreliable methods. The accelerating electrons explain not only the Maxwell Equations and the Special Relativity, but the Heisenberg Uncertainty Relation, the Wave-Particle Duality and the electron's spin also, building the Bridge between the Classical and Quantum Theories. The Planck Distribution Law of the electromagnetic oscillators explains the electron/proton mass rate and the Weak and Strong Interactions by the diffraction patterns. The Weak Interaction changes the diffraction patterns by moving the electric charge from one side to the other side of the diffraction pattern, which violates the CP and Time reversal symmetry. The diffraction patterns and the locality of the self-maintaining electromagnetic potential explains also the Quantum Entanglement, giving it as a natural part of the Relativistic Quantum Theory and making possible to build the Quantum Computer with the help of Quantum Information.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.006
metaresearch head score (Gemma)0.028
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.038
Threshold uncertainty score0.127

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0060.028
Meta-epidemiology (narrow)0.0040.002
Meta-epidemiology (broad)0.0030.004
Bibliometrics0.0070.007
Science and technology studies0.0020.001
Scholarly communication0.0080.014
Open science0.0040.006
Research integrity0.0020.005
Insufficient payload (model declined to judge)0.0380.031

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.523
GPT teacher head0.460
Teacher spread0.064 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations2
Published2018
Admission routes1
Has abstractyes

Explore more

Same venueviXraSame topicScientific Computing and Data ManagementFrench-language works237,207