Výsledky vyhľadávania - Computing the number of zeros of a function
-
1
Computing the Zeros of Characteristic Function of Time-Delayed Systems
ISSN: 1549-7747, 1558-3791Vydavateľské údaje: New York IEEE 01.03.2022Vydané v IEEE transactions on circuits and systems. II, Express briefs (01.03.2022)“…In this brief, a simple algorithm based on the contour integration is presented for computing the zeros of characteristic function of time-delayed systems with invariant time constant…”
Získať plný text
Journal Article -
2
Computing the zeros of cross-product combinations of the Bessel functions with complex order
ISSN: 2590-0374, 2590-0374Vydavateľské údaje: Elsevier B.V 01.11.2025Vydané v Results in applied mathematics (01.11.2025)“…The zeros of cross-product combinations of the Bessel functions are often required as the eigenvalues in boundary-value problems with annular or tubular symmetry…”
Získať plný text
Journal Article -
3
On Computing the Resultant of a Polynomial and an Entire Function
ISSN: 0361-7688, 1608-3261Vydavateľské údaje: Moscow Pleiades Publishing 01.02.2022Vydané v Programming and computer software (01.02.2022)“… This allows one to determine whether these functions have common zeros or not. An algorithm for computing an approximation to the resultant of a polynomial…”
Získať plný text
Journal Article -
4
Computation of Binary Arithmetic Sum Over an Asymmetric Diamond Network
ISSN: 2641-8770, 2641-8770Vydavateľské údaje: Piscataway IEEE 2024Vydané v IEEE journal on selected areas in information theory (2024)“… capacity, which is defined as the average number of times that the function can be computed with zero…”
Získať plný text
Journal Article -
5
Secure Network Function Computation for Linear Functions-Part I: Source Security
ISSN: 0018-9448, 1557-9654Vydavateľské údaje: New York IEEE 01.01.2024Vydané v IEEE transactions on information theory (01.01.2024)“… The secure computing capacity for the above model is defined as the maximum average number of times that the target function can be securely computed with zero error at the sink node with the given…”
Získať plný text
Journal Article -
6
Robust Network Function Computation
ISSN: 0018-9448, 1557-9654Vydavateľské údaje: New York IEEE 01.11.2023Vydané v IEEE transactions on information theory (01.11.2023)“… τ errors is the average number of times that the target function can be computed with zero error for one use of the network with at most…”
Získať plný text
Journal Article -
7
zkVC: Fast Zero-Knowledge Proof for Private and Verifiable Computing
Vydavateľské údaje: IEEE 22.06.2025Vydané v 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“… The cryptographic method known as Zero-Knowledge Proof (ZKP) is renowned for facilitating private and verifiable computing…”
Získať plný text
Konferenčný príspevok.. -
8
A frequency-independent and parallel algorithm for computing the zeros of strictly proper rational transfer functions
ISSN: 0096-3003, 1873-5649Vydavateľské údaje: Elsevier Inc 01.02.2016Vydané v Applied mathematics and computation (01.02.2016)“…We develop an algorithm for computation of the zeros of a strictly proper rational transfer function in partial fraction form, by transforming the problem of finding the roots of the determinant…”
Získať plný text
Journal Article -
9
ASMCC+: A Secure Authentication Scheme for Mobile Cloud Computing Environment Based on Zero Trust Architecture
ISSN: 0098-3063, 1558-4127Vydavateľské údaje: New York IEEE 01.08.2024Vydané v IEEE transactions on consumer electronics (01.08.2024)“…Authenticated key exchange (AKE) schemes that adopt public-key encryption (PKE) are comprehensively applied in mobile cloud computing environments…”
Získať plný text
Journal Article -
10
On the number of the rational zeros of linearized polynomials and the second-order nonlinearity of cubic Boolean functions
ISSN: 1936-2447, 1936-2455Vydavateľské údaje: New York Springer US 01.07.2020Vydané v Cryptography and communications (01.07.2020)“…Determine the number of the rational zeros of any given linearized polynomial is one of the vital problems in finite field theory, with applications in modern symmetric cryptosystems…”
Získať plný text
Journal Article -
11
A Themed Issue on Mathematical Inequalities, Analytic Combinatorics and Related Topics in Honor of Professor Feng Qi
ISBN: 9783036590004, 3036590013, 3036590005, 9783036590011Vydavateľské údaje: Basel MDPI - Multidisciplinary Digital Publishing Institute 2023“…The purpose of this Special Issue is to pay tribute to the significant contributions made by Professor Feng Qi in these fields and to provide some important…”
Získať plný text
E-kniha -
12
No-Signalling-Assisted Zero-Error Capacity of Quantum Channels and an Information Theoretic Interpretation of the Lovász Number
ISSN: 0018-9448, 1557-9654Vydavateľské údaje: New York IEEE 01.02.2016Vydané v IEEE transactions on information theory (01.02.2016)“…We study the one-shot zero-error classical capacity of a quantum channel assisted by quantum no-signalling correlations, and the reverse problem of exact simulation of a prescribed channel by a noiseless classical one…”
Získať plný text
Journal Article -
13
Orthogonal Polynomials and Special Functions: Recent Trends and Their Applications
ISBN: 9783725818549, 9783725818532, 3725818533, 3725818541Vydavateľské údaje: MDPI - Multidisciplinary Digital Publishing Institute 2024“… As such, the number of theoretical and applied problems solved using orthogonal polynomials and special functions is constantly…”
Získať plný text
E-kniha -
14
The second-order zero differential spectra of some functions over finite fields
ISSN: 1936-2447, 1936-2455Vydavateľské údaje: New York Springer US 01.07.2025Vydané v Cryptography and communications (01.07.2025)“… (which is the same as the second-order zero differential uniformity in even characteristic) of perfect nonlinear functions is 0 on F p n ( p prime…”
Získať plný text
Journal Article -
15
Attack and Defense Strategies in Cyber War Involving Production and Stockpiling of Zero-Day Cyber Exploits
ISSN: 1387-3326, 1572-9419Vydavateľské údaje: New York Springer US 01.12.2021Vydané v Information systems frontiers (01.12.2021)“…Two players strike balances between allocating resources for defense and production of zero-day exploits…”
Získať plný text
Journal Article -
16
Size-extensive seniority-zero energy functionals derived from configuration interaction with double excitations
ISSN: 1089-7690, 1089-7690Vydavateľské údaje: 28.06.2020Vydané v The Journal of chemical physics (28.06.2020)“…) can reproduce DOCI energies with only a quadratic number of wave function parameters, and, when neglecting the cost associated with any two-electron integral transformations, these parameters…”
Zistit podrobnosti o prístupe
Journal Article -
17
Computing Wiener and Hyper-Wiener Indices of Zero-Divisor Graph of ℤℊ3×ℤI1I2
ISSN: 2314-8896, 2314-8888Vydavateľské údaje: New York Hindawi 2022Vydané v Journal of function spaces (2022)“… The zero-divisor graph assigned to S is an undirected graph, denoted as YS with vertex set V(Y…”
Získať plný text
Journal Article -
18
A direct construction of complete complementary code with zero correlation zone property for prime-power length
ISSN: 1936-2447, 1936-2455Vydavateľské údaje: New York Springer US 01.03.2024Vydané v Cryptography and communications (01.03.2024)“…) and zero correlation zone (ZCZ) sequence set and which we call complete complementary-ZCZ (CC-ZCZ) code set…”
Získať plný text
Journal Article -
19
Computing the zeros of the partial sums of the Riemann zeta function
ISSN: 0373-3114, 1618-1891Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2015Vydané v Annali di matematica pura ed applicata (01.10.2015)“…In this paper, we introduce a formula for the exact number of zeros of every partial sum of the Riemann zeta function inside infinitely many rectangles…”
Získať plný text
Journal Article -
20
Improved Upper Bound on the Network Function Computing Capacity
ISSN: 0018-9448, 1557-9654Vydavateľské údaje: New York IEEE 01.06.2019Vydané v IEEE transactions on information theory (01.06.2019)“… The computing rate of a network code that can compute the target function over the network is the average number of times that the target function is computed with zero error for one use of the network…”
Získať plný text
Journal Article

