English
Related papers

Related papers: On weakly APN functions and 4-bit S-Boxes

200 papers

We give an elementary proof of a generalization of Bourgain and Tzafriri's Restricted Invertibility Theorem, which says roughly that any matrix with columns of unit length and bounded operator norm has a large coordinate subspace on which…

Functional Analysis · Mathematics 2010-10-05 Daniel A. Spielman , Nikhil Srivastava

Current quantum computer technology is sufficient to realize weak measurements and the corresponding concept of weak values. We demonstrate how the weak value anomaly can be tested, along with consistency and simultaneity of weak values,…

Quantum Physics · Physics 2010-02-20 Todd A. Brun , Lajos Diosi , Walter T. Strunz

Weakly supervised object localization remains challenging, where only image labels instead of bounding boxes are available during training. Object proposal is an effective component in localization, but often computationally expensive and…

Computer Vision and Pattern Recognition · Computer Science 2017-09-07 Yi Zhu , Yanzhao Zhou , Qixiang Ye , Qiang Qiu , Jianbin Jiao

Recent model inversion attack algorithms permit adversaries to reconstruct a neural network's private and potentially sensitive training data by repeatedly querying the network. In this work, we develop a novel network architecture that…

Computer Vision and Pattern Recognition · Computer Science 2024-08-27 Sayanton V. Dibbo , Adam Breuer , Juston Moore , Michael Teti

In this paper, we introduce a concept of weakly principally quasi-Baer *-rings in terms of central cover. We prove that a *-rings is a principally quasi-Baer *-rings if and only if it is weakly principally quasi-Baer *-rings with unity. A…

Combinatorics · Mathematics 2016-12-07 Anil Khairnar , B. N. Waphare

The soft-aided bit-marking (SABM) algorithm is based on the idea of marking bits as highly reliable bits (HRBs), highly unreliable bits (HUBs), and uncertain bits to improve the performance of hard-decision (HD) decoders. The HRBs and HUBs…

Information Theory · Computer Science 2021-10-13 Yi Lei , Bin Chen , Gabriele Liga , Alexios Balatsoukas-Stimming , Kaixuan Sun , Alex Alvarado

The resilience of Supervisory Control and Data Acquisition (SCADA) systems for electric power networks for certain cyber-attacks is considered. We analyze the vulnerability of the measurement system to false data attack on communicated…

Optimization and Control · Mathematics 2013-02-18 Julien M. Hendrickx , Karl Henrik Johansson , Raphael M. Jungers , Henrik Sandberg , Kin Cheong Sou

Consider an invertible measure-preserving transformation of a probability space. A finite partition of the space is called weakly independent if there are infinitely many images of this partition under powers of the transformation that are…

Dynamical Systems · Mathematics 2007-06-13 Boris Begun , Andres del Junco

Deploying convolutional neural networks (CNNs) for embedded applications presents many challenges in balancing resource-efficiency and task-related accuracy. These two aspects have been well-researched in the field of CNN compression. In…

We establish analogs of sharp weighted weak-type bounds for $m$-sublinear operators satisfying sparse form domination, including multilinear Calder\'on-Zygmund singular integrals. Our results, which hold for general $\vec{p} \in…

Classical Analysis and ODEs · Mathematics 2024-07-23 Zoe Nieraeth , Cody B. Stockdale , Brandon Sweeting

We propose an iterative procedure for constructing classes of off-shell four-point conformal integrals which are identical. The proof of the identity is based on the conformal properties of a subintegral common for the whole class. The…

High Energy Physics - Theory · Physics 2014-11-18 J. M. Drummond , J. Henn , V. A. Smirnov , E. Sokatchev

In the past few years, an increasing number of machine-learning and deep learning structures, such as Convolutional Neural Networks (CNNs), have been applied to solving a wide range of real-life problems. However, these architectures are…

Cryptography and Security · Computer Science 2021-07-30 Amira Guesmi , Ihsen Alouani , Khaled Khasawneh , Mouna Baklouti , Tarek Frikha , Mohamed Abid , Nael Abu-Ghazaleh

We present an $O(n\log n)$-time algorithm that determines whether a given planar $n$-gon is weakly simple. This improves upon an $O(n^2\log n)$-time algorithm by Chang, Erickson, and Xu (2015). Weakly simple polygons are required as input…

Computational Geometry · Computer Science 2017-08-01 Hugo Akitaya , Greg Aloupis , Jeff Erickson , Csaba D. Tóth

This brief note concerns the invertibility of certain alternant matrices. In particular those that consisting of polynomials and products of polynomials and logarithms are shown to be invertible under appropriate conditions on the degrees…

Classical Analysis and ODEs · Mathematics 2021-08-26 Jeff Ledford

We show that, given a Banach space and a generator of an exponentially stable $C_{0}$-semigroup, a weakly admissible operator $g(A)$ can be defined for any $g$ bounded, analytic function on the left half-plane. This yields an (unbounded)…

Functional Analysis · Mathematics 2012-07-27 Felix Schwenninger , Hans Zwart

The search for light dark matter and cosmic primordial neutrinos necessitates detectors with sub-millielectronvolt (sub-meV) energy thresholds. While superconducting quantum sensors have approached this sensitivity, they often face…

Instrumentation and Detectors · Physics 2026-02-05 Aiqin Gao , Yiming Guo , Hengyu Wang , Xilei Sun , Xuegang Li , Junhua Wang , Junguang Lv , Guopu Qu , Lei Cao

In AFRICACRYPT 2010, Abdalla et al. first proposed a slight modification to the computations steps of the BD protocol, called mBD+P. Then they extended mBD+P protocol into mBD+S protocol. In this paper, we show that both of mBD+P and mBD+S…

Cryptography and Security · Computer Science 2010-08-09 Qingfeng Cheng , Chuangui Ma

Necessary and sufficient conditions are given for when a sequence of finite dimensional subspaces (X_n) can be blocked to be a skipped blocking decompositon (SBD). These are very similar to known results about blocking of biorthogonal…

Functional Analysis · Mathematics 2007-05-23 Steven F. Bellenot

We prove that algebras are left weakly Gorenstein in case the subcategory $^{\perp}A \cap \Omega^n(A)$ is representation-finite. This applies in particular to all monomial algebras and endomorphism algebras of modules over…

Representation Theory · Mathematics 2023-10-30 Rene Marczinzik

In this article we prove the following version of the Weak-BAB conjecture for $3$-folds in char $p>5$: Fix a DCC set $I\subset [0, 1)$ and an algebraically closed field $k$ of characteristic $p>5$. Let $\mathfrak{D}$ be a collection of klt…

Algebraic Geometry · Mathematics 2019-02-22 Omprokash Das