sign in to customize
  • Experimental demonstration of quantum advantage for NP verification
    Federico Centrone, Niraj Kumar, Eleni Diamanti, Iordanis Kerenidis
    Aug 03 2020 green加速器下载 arXiv:2007.15876v1
    We show the first experimental demonstration of a computational quantum advantage (also referred to as quantum supremacy) with linear optics, by studying the computational task of the verification of an NP-complete problem by a verifier who only gets limited information about the proof. We provide a simple linear optical implementation that can perform this task efficiently (within a few seconds), while we also provide strong evidence that a classical computer would take time greater than the age of the universe (assuming only that classically it takes exponential time to solve an NP-complete problem). The verification of NP-complete problems with limited information brings us a step closer to real-world useful applications, such as server-client quantum computing.
  • Quantum computational advantage with string order parameters of 1D symmetry-protected topological order
    Austin K. Daniel, Akimasa Miyake
    Aug 03 2020 quant-ph arXiv:2007.16160v1
    Nonlocal games with advantageous quantum strategies give arguably the most fundamental demonstration of the power of quantum resources over their classical counterparts. Recently, certain multiplayer generalizations of nonlocal games have been used to prove unconditional separations between small computational complexity classes of shallow-depth circuits. Here, we show advantageous strategies for these nonlocal games for generic ground states of one-dimensional symmetry-protected topological orders (SPTO), when an invariant of SPTO known as a twist phase is nontrivial and -1. Our construction demonstrates that general 1D SPTO with sufficiently large string order parameters possess globally constrained correlations useful for the unconditional computational separation.
  • green加速器极光版_green加速器破解版 - 随意贴:为你提供Green加速器下载,查看最新Green加速器介绍、查看Green加速器应用截图。一键快捷、方便的将安卓版 GREEN 网络加速 器官方客户端 是一款网络加速的 软件,主要用来解决上网极光下载站提供:网络加速器破解版 green网络加速器 green加速器 green
    Rolando D. Somma, green加速器下载
    Aug 03 2020 quant-ph arXiv:2007.15698v1
    We analyze the complexity of quantum state verification in the context of solving systems of linear equations of the form $A \vec x = \vec b$. We show that any quantum operation that verifies whether a given quantum state is within a constant distance from the solution of the quantum linear systems problem requires $q=\Omega(\kappa)$ uses of a unitary that prepares a quantum state $\left| b \right>$, proportional to $\vec b$, and its inverse in the worst case. Here, $\kappa$ is the condition number of the matrix $A$. For typical instances, we show that $q=\Omega(\sqrt \kappa)$ with high probability. These lower bounds are almost achieved if quantum state verification is performed using known quantum algorithms for the quantum linear systems problem. We also analyze the number of copies of $\left| b \right>$ required by verification procedures of the prepare and measure type. In this case, the lower bounds are quadratically worse, being $\Omega(\kappa^2)$ in the worst case and $\Omega(\kappa)$ in typical instances with high probability. We discuss the implications of our results to known variational and related approaches to this problem, where state preparation, gate, and measurement errors will need to decrease rapidly with $\kappa$ for worst-case and typical instances if error correction is not used, and present some open problems.
  • Using Reinforcement Learning to Perform Qubit Routing in Quantum Compilers
    Matteo G. Pozzi, Steven J. Herbert, Akash Sengupta, Robert D. Mullins
    Aug 03 2020 quant-ph arXiv:2007.15957v1
    "Qubit routing" refers to the task of modifying quantum circuits so that they satisfy the connectivity constraints of a target quantum computer. This involves inserting SWAP gates into the circuit so that the logical gates only ever occur between adjacent physical qubits. The goal is to minimise the circuit depth added by the SWAP gates. In this paper, we propose a qubit routing procedure that uses a modified version of the deep Q-learning paradigm. The system is able to outperform the qubit routing procedures from two of the most advanced quantum compilers currently available, on both random and realistic circuits, across near-term architecture sizes.
  • Green - 网际加速器 | 游戏行年11月4日 - Green - 网际加速器© AiSeed Network Technology Co.,Ltd 9 6.3万个评价 来源于渠道 效率参考 获取源 简介 The network speed meter designed for ...
    Nicholas O'Dea, Fiona Burnell, Anushya Chandran, Vedika Khemani
    Aug 03 2020 cond-mat.stat-mech cond-mat.str-el quant-ph arXiv:2007.16207v1
    We present a general symmetry-based framework for obtaining many-body Hamiltonians with scarred eigenstates that do not obey the eigenstate thermalization hypothesis. Our models are derived from parent Hamiltonians with a non-Abelian (or q-deformed) symmetry, whose eigenspectra are organized as degenerate multiplets that transform as irreducible representations of the symmetry (`tunnels'). We show that large classes of perturbations break the symmetry, but in a manner that preserves a particular low-entanglement multiplet of states -- thereby giving generic, thermal spectra with a `shadow' of the broken symmetry in the form of scars. The generators of the Lie algebra furnish operators with `spectrum generating algebras' that can be used to lift the degeneracy of the scar states and promote them to equally spaced `towers'. Our framework applies to several known models with scars, but we also introduce new models with scars that transform as irreducible representations of symmetries such as SU(3) and $q$-deformed SU(2), significantly generalizing the types of systems known to harbor this phenomenon. Additionally, we present new examples of generalized AKLT models with scar states that do not transform in an irreducible representation of the relevant symmetry. These are derived from parent Hamiltonians with enhanced symmetries, and bring AKLT-like models into our framework.
  • Optimal Layout Synthesis for Quantum Computing
    Bochen Tan, Jason Cong
    Aug 03 2020 cs.AR quant-ph arXiv:2007.15671v1
    Recent years have witnessed the fast development of quantum computing. Researchers around the world are eager to run larger and larger quantum algorithms that promise speedups impossible to any classical algorithm. However, the available quantum computers are still volatile and error-prone. Thus, layout synthesis, which transforms quantum programs to meet these hardware limitations, is a crucial step in the realization of quantum computing. In this paper, we present two synthesizers, one optimal and one approximate but nearly optimal. Although a few optimal approaches to this problem have been published, our optimal synthesizer explores a larger solution space, thus is optimal in a stronger sense. In addition, it reduces time and space complexity exponentially compared to some leading optimal approaches. The key to this success is a more efficient spacetime-based variable encoding of the layout synthesis problem as a mathematical programming problem. By slightly changing our formulation, we arrive at an approximate synthesizer that is even more efficient and outperforms some leading heuristic approaches, in terms of additional gate cost, by up to 100%, and also fidelity by up to 10x on a comprehensive set of benchmark programs and architectures. For a specific family of quantum programs named QAOA, which is deemed to be a promising application for near-term quantum computers, we further adjust the approximate synthesizer by taking commutation into consideration, achieving up to 75% reduction in depth and up to 65% reduction in additional cost compared to the tool used in a leading QAOA study.
  • Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret Minimization
    Samuel B. Hopkins, Jerry Li, Fred Zhang
    Aug 03 2020 cs.DS cs.LG math.ST green加速器下载官网 stat.TH arXiv:2007.15839v1
    奇游电竞加速器_电竞级网络游戏加速器【官方网站】:奇游电竞加速器采用电竞级网络,可畅玩众多热门网络游戏,超低延迟/秒级响应/拒绝丢包,完美加速绝地求生、gta5、csgo ...
  • Device-independent quantum key distribution based on asymmetric CHSH inequalities
    Erik Woodhead, green加速器下载 Stefano Pironio
    Aug 03 2020 quant-ph arXiv:2007.16146v1
    The simplest device-independent quantum key distribution protocol is based on the Clauser-Horne-Shimony-Holt (CHSH) Bell inequality and allows two users, Alice and Bob, to generate a secret key if they observe sufficiently strong correlations. There is, however, a mismatch between the protocol, in which only one of Alice's measurements is used to generate the key, and the CHSH expression, which is symmetric with respect to Alice's two measurements. We therefore investigate the impact of using an extended family of Bell expressions where we give different weights to Alice's measurements. Using this family of asymmetric Bell expressions improves the robustness of the key distribution protocol for certain experimentally-relevant correlations. As an example, the tolerable error rate improves from 7.15% to about 7.42% for the depolarising channel. Adding random noise to Alice's key before the postprocessing pushes the threshold further to more than 8.34%. The main technical result of our work is a tight bound on the von Neumann entropy of one of Alice's measurement outcomes conditioned on a quantum eavesdropper for the family of asymmetric CHSH expressions we consider and allowing for an arbitrary amount of noise preprocessing.
  • 下载 - 月轮网游加速器【官方网站】:月轮网游加速器为网游用户解决延迟、掉线、卡机等问题,让你游戏更爽快!支持绝地求生、H1Z1、CSGO、GTA5等数千款热门游戏的加速,帮助玩家降低游戏延迟,解决卡机掉线,享受更完美的战斗体验。
    Arturo Merino, green加速器下载官网
    Aug 03 2020 cs.DS green加速器下载 arXiv:2007.16144v1
    We study the two-dimensional geometric knapsack problem for convex polygons. Given a set of weighted convex polygons and a square knapsack, the goal is to select the most profitable subset of the given polygons that fits non-overlappingly into the knapsack. We allow to rotate the polygons by arbitrary angles. We present a quasi-polynomial time $O(1)$-approximation algorithm for the general case and a polynomial time $O(1)$-approximation algorithm if all input polygons are triangles, both assuming polynomially bounded integral input data. Also, we give a quasi-polynomial time algorithm that computes a solution of optimal weight under resource augmentation, i.e., we allow to increase the size of the knapsack by a factor of $1+\delta$ for some $\delta>0$ but compare ourselves with the optimal solution for the original knapsack. To the best of our knowledge, these are the first results for two-dimensional geometric knapsack in which the input objects are more general than axis-parallel rectangles or circles and in which the input polygons can be rotated by arbitrary angles.
  • Fast Generation and Detection of Spatial Modes of Light using an Acousto-Optic Modulator
    Boris Braverman, Alexander Skerjanc, Nicholas Sullivan, Robert W. Boyd
    Aug 03 2020 physics.optics quant-ph arXiv:2007.16115v1
    Spatial modes of light provide a high-dimensional space that can be used to encode both classical and quantum information. Current approaches for dynamically generating and measuring these modes are slow, due to the need to reconfigure a high-resolution phase mask such as a spatial light modulator or digital micromirror device. The process of updating the spatial mode of light can be greatly accelerated by multiplexing a set of static phase masks with a fast, image-preserving optical switch, such as an acousto-optic modulator (AOM). We experimentally realize this approach, using a double-pass AOM to generate one of five orbital angular momentum states with a switching rate of up to 500 kHz. We then apply this system to perform fast quantum state tomography of spatial modes of light in a 2-dimensional Hilbert space, by projecting the unknown state onto six spatial modes comprising three mutually unbiased bases. We are able to reconstruct arbitrary states in under 1 ms with an average fidelity of 96.9%.
  • 哪个网游加速器比较好用? - 知乎:2021-6-4 · 里面有我所有找到的18款网游加速器,应该涵盖了目前市面上大部分的网游加速器了。本着辛苦一个,幸福大家的原则,归纳如下: 免费120小时:Xrush网游加速器; 免费72小时:网易UU加速器,迅龙加速器,玲珑加速器,腾讯加速器,量子加速器; ...
    Yiming Chen, Victor Gorbenko, Juan Maldacena
    Aug 03 2020 hep-th arXiv:2007.16091v1
    We consider two dimensional CFT states that are produced by a gravitational path integral. As a first case, we consider a state produced by Euclidean $AdS_2$ evolution followed by flat space evolution. We use the fine grained entropy formula to explore the nature of the state. We find that the naive hyperbolic space geometry leads to a paradox. This is solved if we include a geometry that connects the bra with the ket, a bra-ket wormhole. The semiclassical Lorentzian interpretation leads to CFT state entangled with an expanding and collapsing Friedmann cosmology. As a second case, we consider a state produced by Lorentzian $dS_2$ evolution, again followed by flat space evolution. The most naive geometry also leads to a similar paradox. We explore several possible bra-ket wormholes. The most obvious one leads to a badly divergent temperature. The most promising one also leads to a divergent temperature but by making a projection onto low energy states we find that it has features that look similar to the previous Euclidean case. In particular, the maximum entropy of an interval in the future is set by the de Sitter entropy.
  • Breaking simple quantum position verification protocols with little entanglement
    Andrea Olivo, green加速器下载官网 green加速器下载官网 Frédéric Grosshans
    Aug 03 2020 green加速器下载 arXiv:2007.15808v1
    Instantaneous nonlocal quantum computation (INQC) evades apparent quantum and relativistic constraints and allows to attack generic quantum position verification (QPV) protocols (aiming at securely certifying the location of a distant prover) at an exponential entanglement cost. We consider adversaries sharing maximally entangled pairs of qudits and find low-dimensional INQC attacks against the simple practical family of QPV protocols based on single photons polarized at an angle $\theta$. We find exact attacks against some rational angles, including some sitting outside of the Clifford hierarchy (e.g. $\pi/6$), and show no $\theta$ allows to tolerate errors higher than $\simeq 5\cdot 10^{-3}$ against adversaries holding two ebits per protocol's qubit.
  • Applications of Quantum Computing for Investigations of Electronic Transitions in Phenylsulfonyl-carbazole TADF Emitters
    Qi Gao, Gavin O. Jones, Mario Motta, Michihiko Sugawara, Hiroshi C. Watanabe, Takao Kobayashi, Eriko Watanabe, green加速器下载 Hajime Nakamura, Naoki Yamamoto
    Aug 03 2020 quant-ph physics.chem-ph green加速器下载官网 arXiv:2007.15795v1
    A quantum chemistry study of the first singlet (S1) and triplet (T1) excited states of phenylsulfonyl-carbazole compounds, proposed as useful thermally activated delayed fluorescence (TADF) emitters for organic light emitting diode (OLED) applications, was performed with the quantum Equation-Of-Motion Variational Quantum Eigensolver (qEOM-VQE) and Variational Quantum Deflation (VQD) algorithms on quantum simulators and devices. These quantum simulations were performed with double zeta quality basis sets on an active space comprising the highest occupied and lowest unoccupied molecular orbitals (HOMO, LUMO) of the TADF molecules. The differences in energy separations between S1 and T1 ($\Delta E_{st}$) predicted by calculations on quantum simulators were found to be in excellent agreement with experimental data. Differences of 16 and 88 mHa with respect to exact energies were found for excited states by using the qEOM-VQE and VQD algorithms, respectively, to perform simulations on quantum devices without error mitigation. By utilizing error mitigation by state tomography to purify the quantum states and correct energy values, the large errors found for unmitigated results could be improved to differences of, at most, 3 mHa with respect to exact values. Consequently, excellent agreement could be found between values of $\Delta E_{st}$ predicted by quantum simulations and those found in experiments.
  • Distribution-Free Models of Social Networks
    Tim Roughgarden, C. Seshadhri
    Aug 03 2020 cs.DS cs.SI arXiv:2007.15743v1
    The structure of large-scale social networks has predominantly been articulated using generative models, a form of average-case analysis. This chapter surveys recent proposals of more robust models of such networks. These models posit deterministic and empirically supported combinatorial structure rather than a specific probability distribution. We discuss the formal definitions of these models and how they relate to empirical observations in social networks, as well as the known structural and algorithmic results for the corresponding graph classes.
  • Decoherence-free radiofrequency dressed subspaces
    G.A. Sinuco-Leon, H. Mas, S. Pandey, G. Vasilakis, B.M. Garraway, W. von Klitzing
    Aug 03 2020 green加速器下载 cond-mat.quant-gas quant-ph arXiv:2007.15730v1
    We study the spectral signatures and coherence properties of radiofrequency dressed hyperfine Zeeman sub-levels of 87Rb. Experimentally, we engineer combinations of static and RF magnetic fields to modify the response of the atomic spin states to environmental magnetic field noise. We demonstrate analytically and experimentally the existence of 'magic' dressing conditions where decoherence due to electromagnetic field noise is strongly suppressed. Building upon this result, we propose a bi-chromatic dressing configuration that reduces the global sensitivity of the atomic ground states to low-frequency noise, and enables the simultaneous protection of multiple transitions between the two ground hyperfine manifolds of atomic alkali species. Our methods produce protected transitions between any pair of hyperfine sub-levels at arbitrary (low) DC-magnetic fields.
  • Viscoelasticity enables self-organization of bacterial active matter in space and time
    Song Liu, green加速器下载官网 green加速器下载 green加速器下载
    Aug 03 2020 cond-mat.soft physics.flu-dyn arXiv:2007.16206v1
    Active matter consists of units that generate mechanical work by consuming energy. Examples include living systems, such as assemblies of bacteria and biological tissues, biopolymers driven by molecular motors, and suspensions of synthetic self-propelled particles. A central question in the field is to understand and control the self-organization of active assemblies in space and time. Most active systems exhibit either spatial order mediated by interactions that coordinate the spatial structure and the motion of active agents or the temporal synchronization of individual oscillatory dynamics. The simultaneous control of spatial and temporal organization is more challenging and generally requires complex interactions, such as reaction-diffusion hierarchies or genetically engineered cellular circuits. Here, we report a novel and simple means to simultaneously control the spatial and temporal self-organization of bacterial active matter. By confining an active bacterial suspension and manipulating a single macroscopic parameter, namely the viscoelasticity of the suspending fluid, we have found that the bacterial fluid first self-organizes in space into a millimeter-scale rotating vortex; then displays temporal organization as the giant vortex switches its global chirality periodically with tunable frequency, reminiscent of a torsional pendulum - a self-driven one. Combining experiments with an active matter model, we explain this striking behavior in terms of the interplay between active forcing and viscoelastic stress relaxation. Our findings advance the understanding of bacterial behavior in complex fluids, and demonstrate experimentally for the first time that rheological properties can be harnessed to control active matter flows. Coupled with actuation, our tunable self-oscillating bacterial vortex may be used as a "clock" for locomotion of soft robots and microfluidic pumping.
  • Geometric Superconductivity in 3D Hofstadter Butterfly
    Moon Jip Park, Yong Baek Kim, SungBin Lee
    Aug 03 2020 cond-mat.supr-con cond-mat.str-el arXiv:2007.16205v1
    Electrons on the lattice subject to a strong magnetic field exhibit the fractal spectrum of electrons, which is known as the Hofstadter butterfly. In this work, we investigate unconventional superconductivity in a three-dimensional Hofstadter butterfly system. While it is generally difficult to achieve the Hofstadter regime, we show that the quasi-two-dimensional materials with a tilted magnetic field produce the large-scale superlattices, which generate the Hofstadter butterfly even at the moderate magnetic field strength. We first show that the van-Hove singularities of the butterfly flat bands greatly elevate the superconducting critical temperature, offering a new mechanism of field-enhanced superconductivity. Furthermore, we demonstrate that the quantum geometry of the Landau mini-bands plays a crucial role in the description of the superconductivity, which is shown to be clearly distinct from the conventional superconductors. Finally, we discuss the relevance of our results to the recently discovered re-entrant superconductivity of UTe2 in strong magnetic fields.
  • vp01.sysdaa.com的综合查询_Green加速器丨游戏网络加速器,网游加...:2021年6月26日 - 爱站网站长seo综合查询工具提供网站收录查询和站长查询以及百度权重值查询等多个站长工具,免费查询各种数据,包括收录、反链及关键词排名等。
    Brian Kim, Yalin E. Sagduyu, Tugba Erpek, Kemal Davaslioglu, green加速器下载
    Aug 03 2020 eess.SP cs.LG cs.NI stat.ML arXiv:2007.16204v1
    sgreen加速器官网:下载 sgreen加速器 苹果版 版本号:1.0.3 时间:01-12 下载 sgreen加速器 苹果版 版本号:1.0.4 时间:01-12 下载 专题推荐更多> 微鲤小说 必威...
  • Distinguishing secant from cactus varieties
    Maciej Gałązka, Tomasz Mańdziuk, Filip Rupniewski
    Aug 03 2020 math.AG arXiv:2007.16203v1
    In this paper we study homogeneous polynomials and vector subspaces of a polynomial ring that are divisible by a large power of a linear form. We compute their cactus and border cactus ranks. We show that for $d\geq 5$, the component of the cactus variety $\kappa_{14}(\nu_d(\mathbb{P}^6))$ other than the secant variety $\sigma_{14}(\nu_d(\mathbb{P}^6))$ consists of degree $d$ polynomials divisible by $(d-3)$-th power of a linear form. For $d\geq 6$ we present an algorithm for deciding whether a point in the cactus variety $\kappa_{14}(\nu_d(\mathbb{P}^6))$ belongs to the secant variety $\sigma_{14}(\nu_d(\mathbb{P}^6))$. Analogously, we show that for $d\geq 5$, the component of the Grassmann cactus variety $\kappa_{8,3}(\nu_d(\mathbb{P}^4))$ other than the Grassmann secant variety $\sigma_{8,3}(\nu_d(\mathbb{P}^4))$ consists of subspaces divisible by $(d-2)$-th power of a linear form. Finally, for $d\geq 5$ we present an algorithm for deciding whether a point in the Grassmann cactus variety $\kappa_{8,3}(\nu_d(\mathbb{P}^4))$ belongs to the Grassmann secant variety $\sigma_{8,3}(\nu_d(\mathbb{P}^4))$.
  • Collective 2p-2h intruder states in $^{118}$Sn studied via $\beta$-decay of $^{118}$In using GRIFFIN
    K. Ortner, C. Andreoiu, green加速器下载官网 G.C. Ball, N. Bernier, H. Bidaman, V. Bildstein, M. Bowry, D.S. Cross, M.R. Dunlop, R. Dunlop, F.H. Garcia, A.B. Garnsworthy, P.E. Garrett, J. Henderson, green加速器下载官网 B. Olaizola, J. Park, C.M. Petrache, J.L. Pore, green加速器下载
    Aug 03 2020 nucl-ex arXiv:2007.16202v1
    The low-lying structure of semi-magic $^{118}$Sn has been investigated through the $\beta$-decay of $^{118}$In ($T_{1/2}=4.45$ min) to study shape coexistence via the reduced transition probabilities of states in the 2p-2h proton intruder band. This high-statistics study was carried out at TRIUMF-ISAC with the GRIFFIN spectrometer. In total, 99 transitions have been placed in the level scheme with 43 being newly observed. Three low-lying $\gamma$-ray transitions with energies near 285 keV have been resolved from which the 2$^+_{\mathrm{intr.}} \rightarrow 0^+_{\mathrm{intr.}}$ 284.52-keV transition was determined to have half of the previous branching fraction leading to a $B(E2;2^+_2\rightarrow 0^+_2)$ of 21(4) W.u. compared to 39(7) W.u. from the previous measurement. Calculations using $sd$ IBM-2 with mixing have also been made to compare the experimental $B(E2)$ values to the theoretical values and to make comparisons to the $^{114,116}$Sn isotopes previously studied using the same theoretical model.
  • Impact ionization and multiple photon absorptions in the two-dimensional photoexcited Hubbard model
    H.G. Evertz, F. Maislinger
    Aug 03 2020 cond-mat.str-el arXiv:2007.16201v1
    We study the non-equilibrium response of a 4x3 Hubbard model at U=8 under the influence of a short electric field pulse, with the main focus on multiple photon excitations and on the change of double occupancy after the pulse. The behavior mainly depends on the driving frequency of the electric field. The largest change of double occupancy occurs during the pulse. For frequencies below the Mott gap, we observe multiphoton excitations at large field intensities. For frequencies beyond the gap energy, there is a region where Auger recombination reduces the double occupancy after the pulse. Impact ionization (Multi Exciton Generation), namely a growing double occupancy after the pulse, occurs for frequencies larger than twice the Mott gap. From the Loschmidt amplitude we compute the eigenstate spectrum of the quantum state after the pulse, observing multiple distinct photon excitation peaks, in line with expectations from a quasiparticle picture. We introduce a technique with which we analyze the time evolution of double occupancy in each peak individually. The long-term behavior of the double occupancy almost only depends on the absorbed energy, and we explore the connection of this property to the Eigenstate Thermalization Hypothesis.
  • Quantum One-class Classification With a Distance-based Classifier
    green加速器下载 green加速器下载官网 green加速器下载官网 Adenilton J. da Silva
    Aug 03 2020 quant-ph cs.LG arXiv:2007.16200v1
    Distance-based Quantum Classifier (DBQC) is a quantum machine learning model for pattern recognition. However, DBQC has a low accuracy on real noisy quantum processors. We present a modification of DBQC named Quantum One-class Classifier (QOCC) to improve accuracy on NISQ (Noisy Intermediate-Scale Quantum) computers. Experimental results were obtained by running the proposed classifier on a computer provided by IBM Quantum Experience and show that QOCC has improved accuracy over DBQC.
  • John Ward: Memoir of a Theoretical Physicist
    Norman Dombey
    Aug 03 2020 physics.hist-ph arXiv:2007.16199v1
    A scientific biography of John Ward, who was responsible for the Ward Identity in quantum electrodynamics; the first detailed calculation of the quantum entanglement of two photons in electron-positron annihilation with Maurice Pryce; the prediction of neutral weak currents in electroweak theory with Shelly Glashow and Abdus Salam, and many other major calculations in theoretical physics.
  • Object Detection and Tracking Algorithms for Vehicle Counting: A Comparative Analysis
    Vishal Mandal, green加速器下载官网
    Aug 03 2020 green加速器下载官网 arXiv:2007.16198v1
    The rapid advancement in the field of deep learning and high performance computing has highly augmented the scope of video based vehicle counting system. In this paper, the authors deploy several state of the art object detection and tracking algorithms to detect and track different classes of vehicles in their regions of interest (ROI). The goal of correctly detecting and tracking vehicles' in their ROI is to obtain an accurate vehicle count. Multiple combinations of object detection models coupled with different tracking systems are applied to access the best vehicle counting framework. The models' addresses challenges associated to different weather conditions, occlusion and low-light settings and efficiently extracts vehicle information and trajectories through its computationally rich training and feedback cycles. The automatic vehicle counts resulting from all the model combinations are validated and compared against the manually counted ground truths of over 9 hours' traffic video data obtained from the Louisiana Department of Transportation and Development. Experimental results demonstrate that the combination of CenterNet and Deep SORT, Detectron2 and Deep SORT, and YOLOv4 and Deep SORT produced the best overall counting percentage for all vehicles.
  • Resolvent analysis of an airfoil laminar separation bubble at Re = 500,000
    green加速器下载 Stuart I. Benton, Kunihiko Taira, green加速器下载官网
    Aug 03 2020 physics.flu-dyn arXiv:2007.16197v1
    We perform resolvent analysis to examine the perturbation dynamics over the laminar separation bubble (LSB) that forms near the leading edge of a NACA 0012 airfoil at a chord-based Reynolds number of 500,000 and an angle of attack of 8 degrees. Randomized SVD is adopted in the present analysis to relieve the computational cost associated with the high-Re global base flow. To examine the local physics over the LSB, we consider the use of exponential discounting to limit the time horizon that allows for the instability to develop with respect to the base flow. With discounting, the gain distribution over frequency accurately captures the spectral content over the LSB obtained from flow simulation. The peak-gain frequency also agrees with previous flow control results on suppressing dynamic stall over a pitching airfoil. According to the gain distribution and the modal structures, we conclude that the dominant energy-amplification mechanism is the Kelvin-Helmholtz instability. In addition to discounting, we also examine the use of spatial windows for both the forcing and response. From the response-windowed analysis, we find that the LSB serves the main role of energy amplifier, with the amplification saturating at the reattachment point. The input window imposes the constraint of surface forcing, and the results show that the optimal actuator location is slightly upstream of the separation point. The surface-forcing mode also suggest the optimal momentum forcing in the surface-tangent direction, with strong uni-directionality that is ideal for synthetic-jet-type actuators. This study demonstrates the strength of randomized resolvent analysis in tackling high-Reynolds-number base flows and calls attention to the care needed for base-flow instabilities.
  • Designing Neural Speaker Embeddings with Meta Learning
    Manoj Kumar, Tae Jin-Park, Somer Bishop, green加速器下载
    Aug 03 2020 eess.AS cs.SD arXiv:2007.16196v1
    Neural speaker embeddings trained using classification objectives have demonstrated state-of-the-art performance in multiple applications. Typically, such embeddings are trained on an out-of-domain corpus on a single task e.g., speaker classification, albeit with a large number of classes (speakers). In this work, we reformulate embedding training under the meta-learning paradigm. We redistribute the training corpus as an ensemble of multiple related speaker classification tasks, and learn a representation that generalizes better to unseen speakers. First, we develop an open source toolkit to train x-vectors that is matched in performance with pre-trained Kaldi models for speaker diarization and speaker verification applications. We find that different bottleneck layers in the architecture variedly favor different applications. Next, we use two meta-learning strategies, namely prototypical networks and relation networks, to improve over the x-vector embeddings. Our best performing model achieves a relative improvement of 12.37% and 7.11% in speaker error on the DIHARD II development corpus and the AMI meeting corpus, respectively. We analyze improvements across different domains in the DIHARD corpus. Notably, on the challenging child speech domain, we study the relation between child age and the diarization performance. Further, we show reductions in equal error rate for speaker verification on the SITW corpus (7.68%) and the VOiCES challenge corpus (8.78%). We observe that meta-learning particularly offers benefits in challenging acoustic conditions and recording setups encountered in these corpora. Our experiments illustrate the applicability of meta-learning as a generalized learning paradigm for training deep neural speaker embeddings.
  • 腾讯网游加速器——绝地求生首选加速器【官方推荐】 - QQ:2021-6-9 · 腾讯官方出品的海外游戏网络加速工具。完美加速绝地求生、彩虹六号、GTA5、无限法则、战地等上百款海外游戏,有效解决游戏中出现的延迟、丢包、卡顿等问题。72小时超长免费试用,体验后购 …
    Mohammed Hamzah Abed, green加速器下载官网 Ali D. Alfoudi, Abayomi M. Otebolaku, Yasmeen Sajid Razooqi
    Aug 03 2020 cs.CV arXiv:2007.16195v1
    Palm vein identification (PVI) is a modern biometric security technique used for increasing security and authentication systems. The key characteristics of palm vein patterns include, its uniqueness to each individual, unforgettable, non-intrusive and cannot be taken by an unauthorized person. However, the extracted features from the palm vein pattern are huge with high redundancy. In this paper, we propose a combine model of two-Dimensional Discrete Wavelet Transform, Principal Component Analysis (PCA), and Particle Swarm Optimization (PSO) (2D-DWTPP) to enhance prediction of vein palm patterns. The 2D-DWT Extracts features from palm vein images, PCA reduces the redundancy in palm vein features. The system has been trained in selecting high reverent features based on the wrapper model. The PSO feeds wrapper model by an optimal subset of features. The proposed system uses four classifiers as an objective function to determine VPI which include Support Vector Machine (SVM), K Nearest Neighbor (KNN), Decision Tree (DT) and Naïve Bayes (NB). The empirical result shows the proposed system Iit satisfied best results with SVM. The proposed 2D-DWTPP model has been evaluated and the results shown remarkable efficiency in comparison with Alexnet and classifier without feature selection. Experimentally, our model has better accuracy reflected by (98.65) while Alexnet has (63.5) and applied classifier without feature selection has (78.79).
  • Development of a Sealed Liquid Xenon Time Projection Chamber with a Graphene-Coated Electrode
    Yuehuan Wei, green加速器下载官网 Francesco Lombardi, Zhiheng Jiang, Jingqiang Ye, Kaixuan Ni
    Aug 03 2020 green加速器下载官网 arXiv:2007.16194v1
    The liquid xenon (LXe) time projection chamber (TPC) technology is leading the dark matter direct detection in a wide range of dark matter masses from sub-GeV to a few TeV. To further improve its sensitivity to sub-GeV dark matter and its application in reactor neutrino monitoring via coherent elastic neutrino-nucleus scattering (CEvNS), more understanding and suppression of single/few electrons background rate are needed. Here we report on the design and performance of a sealed LXeTPC with a graphene-coated fused silica window as the cathode. The purpose of the sealed TPC is for isolating the liquid xenon target volume from the majority of outgassing materials in the detector vessel, thus improving the liquid xenon purification efficiency and reducing the impurity-induced single/few electrons background. We investigated the out-gassing rate and purification efficiency using the data from the sealed TPC with a simple purification model. The single electron signals from the photoionization of impurities in LXe are obtained and their correlation with the LXe purity is investigated. The photo-electron emission rate on the graphene-coated electrode is compared to that from stainless steel, the electrode material typically used in LXe detectors. We discuss the possible further improvement and potential applications of the sealed TPC for the next generation liquid xenon experiments for dark matter and neutrino physics.
  • green加速器游戏攻略秘籍_green加速器攻略大全_高分技巧_九..._九游:2021年6月12日 - green加速器官网为您提供green加速器最新过关攻略,green加速器怎么玩,green加速器好玩吗,green加速器怎么刷分刷金币等攻略秘籍,欢迎访问九游green加速器攻略频道。
    green加速器下载 Mohammad Javad Dousti, green加速器下载 Jiatao Gu, Juan Pino
    Aug 03 2020 cs.CL arXiv:2007.16193v1
    Simultaneous translation on both text and speech focuses on a real-time and low-latency scenario where the model starts translating before reading the complete source input. Evaluating simultaneous translation models is more complex than offline models because the latency is another factor to consider in addition to translation quality. The research community, despite its growing focus on novel modeling approaches to simultaneous translation, currently lacks a universal evaluation procedure. Therefore, we present SimulEval, an easy-to-use and general evaluation toolkit for both simultaneous text and speech translation. A server-client scheme is introduced to create a simultaneous translation scenario, where the server sends source input and receives predictions for evaluation and the client executes customized policies. Given a policy, it automatically performs simultaneous decoding and collectively reports several popular latency metrics. We also adapt latency metrics from text simultaneous translation to the speech task. Additionally, SimulEval is equipped with a visualization interface to provide better understanding of the simultaneous decoding process of a system. SimulEval has already been extensively used for the IWSLT 2020 shared task on simultaneous speech translation. Code will be released upon publication.
  • Load Plus Communication Balancing in Contiguous Partitions for Distributed Sparse Matrices: Linear-Time Algorithms
    Peter Ahrens
    Aug 03 2020 green加速器下载官网 arXiv:2007.16192v1
    We study partitioning to parallelize multiplication of one or more dense vectors by a sparse matrix (SpMV or SpMM). We consider contiguous partitions, where the rows (or columns) of the matrix are split into $K$ parts without reordering. We present exact and approximate contiguous partitioning algorithms that minimize the runtime of the longest-running processor under cost models that combine work factors and hypergraph communication factors. This differs from traditional graph or hypergraph partitioning models which minimize total communication under a work balance constraint. We address regimes where partitions of the row space and column space are expected to match (the symmetric case) or are allowed to differ (the nonsymmetric case). Our algorithms use linear space. Our exact algorithm runs in linear time when $K^2$ is sublinear. Our $(1 + \epsilon)$-approximate algorithm runs in linear time when $K\log(1/\epsilon)$ is sublinear. We combine concepts from high-performance computing and computational geometry. Existing load balancing algorithms optimize a linear model of per-processor work. We make minor adaptations to optimize arbitrary nonuniform monotonic increasing or decreasing cost functions which may be expensive to evaluate. We then show that evaluating our model of communication is equivalent to planar dominance counting. We specialize Chazelle's dominance counting algorithm to points in the bounded integer plane and generalize it to trade reduced construction time for increased query time, since our partitioners make very few queries. Our algorithms split the original row (or column) ordering into parts to optimize diverse cost models. Combined with reordering or embedding techniques, our algorithms might be used to build more general heuristic partitioners, as they can optimally round one-dimensional embeddings of direct $K$-way noncontiguous partitioning problems.
  • Opportunities for probing $U(1)_{T3R}$ with light mediators
    Bhaskar Dutta, Sumit Ghosh, Jason Kumar
    Aug 03 2020 hep-ph astro-ph.CO arXiv:2007.16191v1
    We consider strategies for using new datasets to probe scenarios in which light right-handed SM fermions couple to a new gauge group, $U(1)_{T3R}$. This scenario provides a natural explanation for the light flavor sector scale, and a motivation for sub-GeV dark matter. There is parameter space which is currently allowed, but we find that much of it can be probed with future experiments. In particular, cosmological and astrophysical observations, neutrino experiments and experiments which search for displaced visible decay or invisible decay can all play a role. Still, there is a small region of parameter space which even these upcoming experiments will not be able to probe. This model can explain the observed 2.4-3$\sigma$ excess of events at the COHERENT experiment in the parameter space allowed by current laboratory experiments, but the ongoing/upcoming laboratory experiments will decisively probe this possibility.
  • Equivalence of relativistic three-particle quantization conditions
    Tyler D. Blanton, green加速器下载
    Aug 03 2020 hep-lat hep-ph green加速器下载 arXiv:2007.16190v1
    We show that a recently derived alternative form of the relativistic three-particle quantization condition for identical particles can be rewritten in terms of the R matrix introduced to give a unitary representation of the infinite-volume three-particle scattering amplitude. Combined with earlier work, this shows the equivalence of the relativistic effective field theory approach of Refs.[1,2] and the "finite-volume unitarity" approach of Refs.[3,4]. It also provides a generalization of the latter approach to arbitrary angular momenta of two-particle subsystems.
  • Self-supervised learning through the eyes of a child
    green加速器下载官网 Vaibhav V. Gupta, Brenden M. Lake
    Aug 03 2020 cs.CV cs.LG cs.NE arXiv:2007.16189v1
    Within months of birth, children have meaningful expectations about the world around them. How much of this early knowledge can be explained through generic learning mechanisms applied to sensory data, and how much of it requires more substantive innate inductive biases? Addressing this fundamental question in its full generality is currently infeasible, but we can hope to make real progress in more narrowly defined domains, such as the development of high-level visual categories, thanks to improvements in data collecting technology and recent progress in deep learning. In this paper, our goal is to achieve such progress by utilizing modern self-supervised deep learning methods and a recent longitudinal, egocentric video dataset recorded from the perspective of several young children (Sullivan et al., 2020). Our results demonstrate the emergence of powerful, high-level visual representations from developmentally realistic natural videos using generic self-supervised learning objectives.
  • Alternative derivation of the relativistic, three-particle quantization condition
    Tyler D. Blanton, Stephen R. Sharpe
    Aug 03 2020 green加速器下载官网 hep-ph nucl-th arXiv:2007.16188v1
    We present a simplified derivation of the relativistic three-particle quantization condition for identical, spinless particles described by a generic relativistic field theory satisfying a $\mathbb Z_2$ symmetry. The simplification is afforded by using a three-particle quasilocal K matrix that is not fully symmetrized, $\widetilde{\mathcal{K}}_{\rm df,3}^{(u,u)}$, and makes extensive use of time-ordered perturbation theory (TOPT). We obtain a new form of the quantization condition. This new form can then be related algebraically to the standard quantization condition, which depends on a fully symmetric three-particle K matrix, $\mathcal{K}_{\rm df,3}$. The new derivation is fully explicit, allowing, for example, a closed-form expression for $\mathcal{K}_{\rm df,3}$ to be given in terms of TOPT amplitudes. The new form of the quantization condition is similar in structure to that obtained in the "finite-volume unitarity" approach, and in a companion paper we make this connection concrete. Our simplified approach should also allow a more straightforward generalization of the quantization condition to nondegenerate particles, and perhaps also to more than three particles.
  • Ultra-light deep MIR by trimming lottery tickets
    Philippe Esling, Theis Bazin, Adrien Bitton, green加速器下载 Ninon Devis
    Aug 03 2020 cs.LG cs.IR cs.MM cs.SD eess.AS stat.ML arXiv:2007.16187v1
    Current state-of-the-art results in Music Information Retrieval are largely dominated by deep learning approaches. These provide unprecedented accuracy across all tasks. However, the consistently overlooked downside of these models is their stunningly massive complexity, which seems concomitantly crucial to their success. In this paper, we address this issue by proposing a model pruning method based on the lottery ticket hypothesis. We modify the original approach to allow for explicitly removing parameters, through structured trimming of entire units, instead of simply masking individual weights. This leads to models which are effectively lighter in terms of size, memory and number of operations. We show that our proposal can remove up to 90% of the model parameters without loss of accuracy, leading to ultra-light deep MIR models. We confirm the surprising result that, at smaller compression ratios (removing up to 85% of a network), lighter models consistently outperform their heavier counterparts. We exhibit these results on a large array of MIR tasks including audio classification, pitch recognition, chord extraction, drum transcription and onset estimation. The resulting ultra-light deep learning models for MIR can run on CPU, and can even fit on embedded devices with minimal degradation of accuracy.
  • The classical double copy of regular non-singular black holes
    Damien A. Easson, green加速器下载 Tucker Manton
    Aug 03 2020 gr-qc hep-th arXiv:2007.16186v1
    We apply the classical double copy procedure to a class of regular, non-singular black hole solutions. We give several examples, paying particular attention to a string-theory-corrected black hole solution emerging from T-duality. Non-perturbative stringy corrections introduce an ultraviolet (UV) zero-point length cutoff which results in non-singular black hole spacetimes. Apart from the UV regulator, the solution is equivalent to the Bardeen black hole spacetime. We extend this solution to include an asymptotic de Sitter background. All Yang-Mills field theory quantities associated with the double copy are well-behaved and finite for all values of parameters. We present a thorough analysis of the black hole horizon structure, additionally uncovering a simple yet new connection between horizons on the gravity side and electric fields on the gauge theory side of the double copy.
  • Green网络加速器——目前最好用的VPN | IT瘾:2021-3-12 · Green网络加速器——目前最好用的VPN,互联网 口碑营销 GreenVPN SSH VPN , IT社区推荐资讯一、Green Free Video Converter简介: 这是一个完全免费的全能型视频转换工具,虽然感觉这两年出来的同类工具很多,但是只要是免费的,软件志一向 ...
    Marcel Neugebauer, Laurin Fischer, Alexander Jäger, Selim Jochim, Matthias Weidemüller, Martin Gärttner
    Aug 03 2020 quant-ph arXiv:2007.16185v1
    We study the performance of efficient quantum state tomography methods based on neural network quantum states using measured data from a two-photon experiment. Machine learning inspired variational methods provide a promising route towards scalable state characterization for quantum simulators. While the power of these methods has been demonstrated on synthetic data, applications to real experimental data remain scarce. We benchmark and compare several such approaches by applying them to measured data from an experiment producing two-qubit entangled states. We find that in the presence of experimental imperfections and noise, confining the variational manifold to physical states, i.e. to positive semi-definite density matrices, greatly improves the quality of the reconstructed states but renders the learning procedure more demanding. Including additional, possibly unjustified, constraints, such as assuming pure states, facilitates learning, but also biases the estimator.
  • Nonlocal thermoelectricity in a topological Andreev interferometer
    Gianmichele Blasi, Fabio Taddei, Liliana Arrachea, Matteo Carrega, Alessandro Braggio
    Aug 03 2020 cond-mat.mes-hall arXiv:2007.16183v1
    We discuss the phase dependent nonlocal thermoelectric effect in a topological Josephson junction in contact with a normal-metal probe. We show that, due to the helical nature of topological edge states, nonlocal thermoelectricity is generated by a purely Andreev interferometric mechanism. This response can be tuned by imposing a Josephson phase difference, through the application of a dissipationless current between the two superconductors, even without the need of applying an external magnetic field. We discuss in detail the origin of this effect and we provide also a realistic estimation of the nonlocal Seebeck coefficient that results of the order of few $\mu V/K$.
  • A branching process with contact tracing
    M. T. Barlow
    Aug 03 2020 math.PR arXiv:2007.16182v1
    We consider a supercritical branching process and define a contact tracing mechanism on its genealogical tree. We calculate the growth rate of the post tracing process, and give conditions under which the tracing is strong enough to drive the process to extinction.
  • Grassmann geometry of zero sets in reproducing kernel Hilbert spaces
    Esteban Andruchow, green加速器下载 Alejandro Varela
    Aug 03 2020 math.FA math.DG math.MG arXiv:2007.16181v1
    Let $\mathcal{H}$ be a reproducing kernel Hilbert space of functions on a set $X$. We study the problem of finding a minimal geodesic of the Grassmann manifold of $\mathcal{H}$ that joins two subspaces consisting of functions which vanish on given finite subsets of $X$. We establish a necessary and sufficient condition for existence and uniqueness of geodesics, and we then analyze it in examples. We discuss the relation of the geodesic distance with other known metrics when the mentioned finite subsets are singletons. We find estimates on the upper and lower eigenvalues of the unique self-adjoint operators which define the minimal geodesics, which can be made more precise when the underlying space is the Hardy space. Also for the Hardy space we discuss the existence of geodesics joining subspaces of functions vanishing on infinite subsets of the disk, and we investigate when the product of projections onto this type of subspaces is compact.
  • A characterisation of elementary fibrations
    Jacopo Emmenegger, Fabio Pasquali, Giuseppe Rosolini
    Aug 03 2020 math.CT math.LO arXiv:2007.16180v1
    We present a characterisation of elementary fibrations, also known as fibrations with equality, that generalises the one for faithful fibrations, and employ it for a comparison with the structures used in the semantics of the identity type of Martin-Löf type theory.
  • Thermal Analysis of a 3D Stacked High-Performance Commercial Microprocessor using Face-to-Face Wafer Bonding Technology
    Rahul Mathur, green加速器下载官网 green加速器下载 Nikhil Tadepalli, Pranavi Chandupatla, Shawn Hung, Xiaoqing Xu, Saurabh Sinha, Jaydeep Kulkarni
    Aug 03 2020 cs.AR arXiv:2007.16179v1
    3D integration technologies are seeing widespread adoption in the semiconductor industry to offset the limitations and slowdown of two-dimensional scaling. High-density 3D integration techniques such as face-to-face wafer bonding with sub-10 $\mu$m pitch can enable new ways of designing SoCs using all 3 dimensions, like folding a microprocessor design across multiple 3D tiers. However, overlapping thermal hotspots can be a challenge in such 3D stacked designs due to a general increase in power density. In this work, we perform a thorough thermal simulation study on sign-off quality physical design implementation of a state-of-the-art, high-performance, out-of-order microprocessor on a 7nm process technology. The physical design of the microprocessor is partitioned and implemented in a 2-tier, 3D stacked configuration with logic blocks and memory instances in separate tiers (logic-over-memory 3D). The thermal simulation model was calibrated to temperature measurement data from a high-performance, CPU-based 2D SoC chip fabricated on the same 7nm process technology. Thermal profiles of different 3D configurations under various workload conditions are simulated and compared. We find that stacking microprocessor designs in 3D without considering thermal implications can result in maximum die temperature up to 12\degC higher than their 2D counterparts under the worst-case power-indicative workload. This increase in temperature would reduce the amount of time for which a power-intensive workload can be run before throttling is required. However, logic-over-memory partitioned 3D CPU implementation can mitigate this temperature increase by half, which makes the temperature of the 3D design only 6$^\circ$C higher than the 2D baseline. We conclude that using thermal aware design partitioning and improved cooling techniques can overcome the thermal challenges associated with 3D stacking.
  • Precise Local Estimates for Differential Equations driven by Fractional Brownian Motion: Elliptic Case
    Xi Geng, green加速器下载 Samy Tindel
    Aug 03 2020 math.PR arXiv:2007.16178v1
    This article is concerned with stochastic differential equations driven by a $d$ dimensional fractional Brownian motion with Hurst parameter $H>1/4$, understood in the rough paths sense. Whenever the coefficients of the equation satisfy a uniform ellipticity condition, we establish a sharp local estimate on the associated control distance function and a sharp local lower estimate on the density of the solution.
  • Screening and evaluation of potential clinically significant HIV drug combinations against SARS-CoV-2 virus
    Draško Tomić, green加速器下载官网 Attila Marcel Szasz, Melinda Rezeli, Vesna Bačić Vrca, green加速器下载 Jozsef Petrik, Vladimir Jan\djel, Marija Milković Periša, Branka Medved Rogina, Josip Mesarić, Davor Davidović, green加速器下载官网
    Aug 03 2020 q-bio.QM arXiv:2007.16177v1
    In this study, we investigated the inhibition of SARS-CoV-2 spike glycoprotein with HIV drugs and their combinations. This glycoprotein is essential for the reproduction of the SARS-COV-2 virus, so its inhibition opens new avenues for the treatment of patients with COVID-19 disease. In doing so, we used the VINI in silico model of cancer, whose high accuracy in finding effective drugs and their combinations was confirmed in vitro by comparison with existing results from NCI-60 bases, and in vivo by comparison with existing clinical trial results. In the first step, the VINI model calculated the inhibition efficiency of SARS-CoV-2 spike glycoprotein with 44 FDA-approved antiviral drugs. Of these drugs, HIV drugs have been shown to be effective, while others mainly have shown weak or no efficiency. Subsequently, the VINI model calculated the inhibition efficiency of all possible double and triple HIV drug combinations, and among them identified ten with the highest inhibition efficiency. These ten combinations were analyzed by Medscape drug-drug interaction software and LexiComp Drug Interactions. All combinations except the combination of cobicistat_abacavir_rilpivirine appear to have serious interactions (risk rating category D) when dosage adjustments/reductions are required for possible toxicity. Finally, the VINI model compared the inhibition efficiency of cobicistat_abacivir_rilpivirine combination with cocktails and individual drugs already used or planned to be tested against SARS-CoV-2. Combination cobicistat_abacivir_rilpivirine demonstrated the highest inhibition of SARS-CoV-2 spike glycoprotein over others. Thus, this combination seems to be a promising candidate for the further in vitro testing and clinical trials.
  • A Polynomial Approach to the Spectrum of Dirac-Weyl Polygonal Billiards
    M. F. C. Martins Quintela, J. M. B. Lopes dos Santos
    Aug 03 2020 physics.comp-ph cond-mat.mes-hall arXiv:2007.16176v1
    风驰网络加速器 - 建设工程百科 - 造价通百科:2021年6月19日 - 风驰网络加速器手机(安卓)现已推出,在安卓系统的智能手机或安卓系统的平板电脑都可以下载安装使用,可以在fengchinet的官网下载。
  • Hardware/Software Obfuscation against Timing Side-channel Attack on a GPU
    Elmira Karimi, Yunsi Fei, David Kaeli
    Aug 03 2020 cs.CR cs.AR arXiv:2007.16175v1
    GPUs are increasingly being used in security applications, especially for accelerating encryption/decryption. While GPUs are an attractive platform in terms of performance, the security of these devices raises a number of concerns. One vulnerability is the data-dependent timing information, which can be exploited by adversary to recover the encryption key. Memory system features are frequently exploited since they create detectable timing variations. In this paper, our attack model is a coalescing attack, which leverages a critical GPU microarchitectural feature -- the coalescing unit. As multiple concurrent GPU memory requests can refer to the same cache block, the coalescing unit collapses them into a single memory transaction. The access time of an encryption kernel is dependent on the number of transactions. Correlation between a guessed key value and the associated timing samples can be exploited to recover the secret key. In this paper, a series of hardware/software countermeasures are proposed to obfuscate the memory timing side channel, making the GPU more resilient without impacting performance. Our hardware-based approach attempts to randomize the width of the coalescing unit to lower the signal-to-noise ratio. We present a hierarchical Miss Status Holding Register (MSHR) design that can merge transactions across different warps. This feature boosts performance, while, at the same time, secures the execution. We also present a software-based approach to permute the organization of critical data structures, significantly changing the coalescing behavior and introducing a high degree of randomness. Equipped with our new protections, the effort to launch a successful attack is increased up to 1433X . 178X, while also improving encryption/decryption performance up to 7%.
  • Short-term stability of particles in the WD J0914+1914 white dwarf planetary system
    Euaggelos E. Zotos, Dimitri Veras, Tareq Saeed, green加速器下载官网
    Aug 03 2020 astro-ph.EP astro-ph.SR arXiv:2007.16174v1
    Nearly all known white dwarf planetary systems contain detectable rocky debris in the stellar photosphere. A glaring exception is the young and still evolving white dwarf WD J0914+1914, which instead harbours a giant planet and a disc of pure gas. The stability boundaries of this disc and the future prospects for this white dwarf to be polluted with rocks depend upon the mass and orbit of the planet, which are only weakly constrained. Here we combine an ensemble of plausible planet orbits and masses to determine where observers should currently expect to find the outer boundary of the gas disc. We do so by performing a sweep of the entire plausible phase space with short-term numerical integrations. We also demonstrate that particle-star collisional trajectories, which would lead to the (unseen) signature of rocky metal pollution, occupy only a small fraction of the phase space, mostly limited to particle eccentricities above 0.75. Our analysis reveals that a highly inflated planet on a near-circular orbit is the type of planet which is most consistent with the current observations.
  • 燃气背包手机版下载- 全方位下载:2021-6-15 · 一加刷机包下载 green加速器 免费版 green加速器最新破解版 green加速器破解版 BatteryMon软件 BatteryMon软件电脑版 BatteryMon官方版 DolbyHomeTheaterV4 杜比音效驱动程序 PhotoshopCS6精简版 ...
    Taher Hekmatfar, green加速器下载 Sama Goliaei
    Aug 03 2020 cs.IR green加速器下载 stat.ML arXiv:2007.16173v1
    Graph-based recommender systems (GRSs) analyze the structural information in the graphical representation of data to make better recommendations, especially when the direct user-item relation data is sparse. Ranking-oriented GRSs that form a major class of recommendation systems, mostly use the graphical representation of preference (or rank) data for measuring node similarities, from which they can infer a recommendation list using a neighborhood-based mechanism. In this paper, we propose PGRec, a novel graph-based ranking-oriented recommendation framework. PGRec models the preferences of the users over items, by a novel graph structure called PrefGraph. This graph is then exploited by an improved embedding approach, taking advantage of both factorization and deep learning methods, to extract vectors representing users, items, and preferences. The resulting embedding are then used for predicting users' unknown pairwise preferences from which the final recommendation lists are inferred. We have evaluated the performance of the proposed method against the state of the art model-based and neighborhood-based recommendation methods, and our experiments show that PGRec outperforms the baseline algorithms up to 3.2% in terms of NDCG@10 in different MovieLens datasets.
  • Patterns of Patient and Caregiver Mutual Support Connections in an Online Health Community
    Zachary Levonian, Marco Dow, Drew Erikson, Sourojit Ghosh, Hannah Miller Hillberg, Saumik Narayanan, Loren Terveen, Svetlana Yarosh
    Aug 03 2020 cs.HC green加速器下载 arXiv:2007.16172v1
    Online health communities offer the promise of support benefits to users, in particular because these communities enable users to find peers with similar experiences. Building mutually supportive connections between peers is a key motivation for using online health communities. However, a user's role in a community may influence the formation of peer connections. In this work, we study patterns of peer connections between two structural health roles: patient and non-professional caregiver. We examine user behavior in an online health finding peers is not explicitly supported. This context lets us use social network analysis methods to explore the growth of such connections in the wild and identify users' peer communication preferences. We investigated how connections between peers were initiated, finding that initiations are more likely between two authors who have the same role and who are close within the broader communication network. Relationships---patterns of repeated interactions---are also more likely to form and be more interactive when authors have the same role. Our results have implications for the design of systems supporting peer communication, e.g. peer-to-peer recommendation systems.
  • Reversible Debugging in Logic Programming
    Germán Vidal
    Aug 03 2020 cs.PL cs.LO arXiv:2007.16171v1
    Reversible debugging is becoming increasingly popular for locating the source of errors. This technique proposes a more natural approach to debugging, where one can explore a computation from the observable misbehaviour backwards to the source of the error. In this work, we propose a reversible debugging scheme for logic programs. For this purpose, we define an appropriate instrumented semantics (a so-called Landauer embedding) that makes SLD resolution reversible. An implementation of a reversible debugger for Prolog, rever, has been developed and is publicly available.


Green加速器 - 云墙专业版应用排名和商店数据 | App Annie:查看Green加速器 - 云墙专业版在中国的下载排名历史。排名历史显示Green加速器 - 云墙专业版在iOS Store应用商店中的流行度以及其随着时间的变化。您可以追踪Green加速器 - 云墙专业版在不同国家、分类和设备上每一天每一小时的表现。
green加速器下载 Aug 03 2020 07:37 UTC

Thanks for your suggestion, but there is a reason why in this case I prefer a separate submission to an update.

LoCo加速器 - 下载:2021-1-15 · LoCo加速器, 免费下载. LoCo加速器: LoCo加速器 概述 LoCo加速器 是在由LoCo加速器开发类别 Education Shareware 软件。 最新版本是 LoCo加速器 的目前未知。 它最初被添加到我们的数据库 …

Green加速器官网:2021-10-9 · 【官网优惠:买1年送3个月】Green加速器官网是Green VNP官网升级版,本站提供提供GreenVNP下载服务,可用于电脑PC,Mac,苹果iOS,Android安卓版APP,Linux、路由器VNP等Green加速器客户端下载,全球网络加速。
Marco Tomamichel Aug 03 2020 00:32 UTC

The common thing people do is to simply update the arXiv submission. As arXiv keeps old versions stored, this seems a clean way to include an addendum.

Dynamics of Renyi entanglement entropy in local quantum circuits with cha...
green加速器下载 Jul 29 2020 05:32 UTC


It is very unfortunate that the policy of arXiv does not allow an addendum as a separate submission so that I have to post it elsewhere. I am adding this comment here in order to advertise the addendum, for few people keep an eye on viXra

哪个网游加速器比较好用? - 知乎 - Zhihu:2021-6-4 · 里面有我所有找到的18款网游加速器,应该涵盖了目前市面上大部分的网游加速器了。本着辛苦一个,幸福大家的原则,归纳如下: 免费120小时:Xrush网游加速器; 免费72小时:网易UU加速器,迅龙加速器,玲珑加速器,腾讯加速器,量子加速器; ...
Yuxuan Du Jul 28 2020 14:26 UTC

Hi William, thanks for your comment. Please refer to Appendix I for the discussion about the more general settings beyond depolarization noise.

亿游联机加速器-畅享联机加速新体验-免费试用【官方网站】:亿游联机加速器专注外服网游加速,支持Steam ,Origin ,Uplay ,Battle.net等海外平台,支持PC、PS4、xbox多平台加速;为您游戏延迟过高,登录不上,掉线频繁,搜不到人等问题;
green加速器下载官网 green加速器下载

What are the conditions for the results regarding noisy learning to break down when you go beyond depolarizing noise?

Limitations of Hartree-Fock with quantum resources
Ryan Babbush Jul 21 2020 03:51 UTC

作为一支萌新,刚刚用green加速器玩了下,延迟300plus是怎么回事,老...:1楼: 作为一支萌新,刚刚用green加速器玩了下,延迟300plus...5楼: 试试迅龙加速器

Quantum Correlations Can Speed Up All Classical Computation
Sam Jaques Jul 17 2020 13:07 UTC

Do you have a reference/reason for k-local gates to have cost proportional to k?

green绿色加速器_greenvnp官网 - 随意贴:2021-3-27 · green绿色加速器_greenvnp官网 蜗牛VPN网络加速器|蜗牛网络加速辅助1.0 绿色 623x406 - 226KB - PNG 极速网络加速器1.0.1.0绿色免费版_闪电下载吧 359x240 - 22KB - JPEG
Alex Wozniakowski Jul 14 2020 13:44 UTC

The [repository][1], which contains the code for this paper, is now available open-source.


Getting to the Bottom of Noether's Theorem
Blake Stacey Jul 14 2020 03:14 UTC

Discussions of this paper have transpired [here]( and [here](

Physics-inspired forms of the Bayesian Cramér-Rao bound
Mankei Tsang Jul 10 2020 14:36 UTC

The arXiv admin fixed it! The PDF should now work.

好用的梯子加速器免费  ssr一個月130G  优途加速器超时  永久免费安卓代理ip  谷歌市场免费梯子  Authors » Authors  加速器极速  佛跳墙w下载