Suchergebnisse - Computing the number of zeros of a function

Computing the Zeros of Characteristic Function of Time-Delayed Systems von Du, Huanchao, Shen, Jieshi, Liu, Ying

“… 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 …”
Volltext

Computing the zeros of cross-product combinations of the Bessel functions with complex order von Kershaw, Jeff, Obata, Takayuki

“… 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 …”
Volltext

On Computing the Resultant of a Polynomial and an Entire Function von Kuzovatov, V. I., Kytmanov, A. A., Myshkina, E. K.

“… 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 …”
Volltext

Computation of Binary Arithmetic Sum Over an Asymmetric Diamond Network von Zhang, Ruze, Guang, Xuan, Yang, Shenghao, Niu, Xueyan, Bai, Bo

“… capacity, which is defined as the average number of times that the function can be computed with zero …”
Volltext

Secure Network Function Computation for Linear Functions-Part I: Source Security von Guang, Xuan, Bai, Yang, Yeung, Raymond W.

“… 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 …”
Volltext

Robust Network Function Computation von Wei, Hengjia, Xu, Min, Ge, Gennian

“… τ 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 …”
Volltext

zkVC: Fast Zero-Knowledge Proof for Private and Verifiable Computing von Zhang, Yancheng, Zheng, Mengxin, Chen, Xun, Hu, Jingtong, Shi, Weidong, Ju, Lei, Solihin, Yan, Lou, Qian

“… The cryptographic method known as Zero-Knowledge Proof (ZKP) is renowned for facilitating private and verifiable computing …”
Volltext

A frequency-independent and parallel algorithm for computing the zeros of strictly proper rational transfer functions von Zadehgol, Ata

“… 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 …”
Volltext

ASMCC+: A Secure Authentication Scheme for Mobile Cloud Computing Environment Based on Zero Trust Architecture von Jakir Hossain, Md, Seid, Abegaz Mohammed, Abishu, Hayla Nahom, Dharejo, Fayaz Ali, Jhaveri, Rutvij H., Erbad, Aiman, Alathbah, Moath

“… Authenticated key exchange (AKE) schemes that adopt public-key encryption (PKE) are comprehensively applied in mobile cloud computing environments …”
Volltext

On the number of the rational zeros of linearized polynomials and the second-order nonlinearity of cubic Boolean functions von Mesnager, Sihem, Kim, Kwang Ho, Jo, Myong Song

“… 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 …”
Volltext

A Themed Issue on Mathematical Inequalities, Analytic Combinatorics and Related Topics in Honor of Professor Feng Qi

“… 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 …”
Volltext

No-Signalling-Assisted Zero-Error Capacity of Quantum Channels and an Information Theoretic Interpretation of the Lovász Number von Runyao Duan, Winter, Andreas

“… 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 …”
Volltext

Orthogonal Polynomials and Special Functions: Recent Trends and Their Applications

“… As such, the number of theoretical and applied problems solved using orthogonal polynomials and special functions is constantly …”
Volltext

The second-order zero differential spectra of some functions over finite fields von Garg, Kirpa, Hasan, Sartaj Ul, Riera, Constanza, Stănică, Pantelimon

“… (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 …”
Volltext

Attack and Defense Strategies in Cyber War Involving Production and Stockpiling of Zero-Day Cyber Exploits von Hausken, Kjell, Welburn, Jonathan W.

“… Two players strike balances between allocating resources for defense and production of zero-day exploits …”
Volltext

Size-extensive seniority-zero energy functionals derived from configuration interaction with double excitations von Vu, Nam, DePrince, A Eugene

“… ) 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 …”
Weitere Angaben

Computing Wiener and Hyper-Wiener Indices of Zero-Divisor Graph of ℤℊ3×ℤI1I2 von Liu, Yonghong, Rauf, Abdul, AdnanAslam, Ishaq, Saira, Issa, Abudulai

“… The zero-divisor graph assigned to S is an undirected graph, denoted as YS with vertex set V(Y …”
Volltext

A direct construction of complete complementary code with zero correlation zone property for prime-power length von Kumar, Nishant, Majhi, Sudhan, Upadhyay, Ashish K.

“… ) and zero correlation zone (ZCZ) sequence set and which we call complete complementary-ZCZ (CC-ZCZ) code set …”
Volltext

Computing the zeros of the partial sums of the Riemann zeta function von Mora, G., Sepulcre, J. M.

“… 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 …”
Volltext

Improved Upper Bound on the Network Function Computing Capacity von Guang, Xuan, Yeung, Raymond W., Yang, Shenghao, Li, Congduan

“… 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 …”
Volltext