Results 91 to 100 of about 236,217 (313)

Efficient and Universal Merkle Tree Inclusion Proofs via OR Aggregation

Cryptography
Zero-knowledge proofs have emerged as a powerful tool for enhancing privacy and security in blockchain applications. However, the efficiency and scalability of proof systems remain a significant challenge, particularly in the context of Merkle tree ...
Oleksandr Kuznetsov, Alex Rusnak, Anton Yezhov, Dzianis Kanonik, Kateryna Kuznetsova, Oleksandr Domin   +5 more
doaj   +1 more source

A Q‐Learning Algorithm to Solve the Two‐Player Zero‐Sum Game Problem for Nonlinear Systems

International Journal of Adaptive Control and Signal Processing, Volume 39, Issue 3, Page 566-581, March 2025.
A Q‐learning algorithm to solve the two‐player zero‐sum game problem for nonlinear systems. ABSTRACT This paper deals with the two‐player zero‐sum game problem, which is a bounded L2$$ {L}_2 $$‐gain robust control problem. Finding an analytical solution to the complex Hamilton‐Jacobi‐Issacs (HJI) equation is a challenging task.
Afreen Islam, Anthony Siming Chen, Guido Herrmann   +2 more
wiley   +1 more source

Algorithms for the Reconstruction of Genomic Structures with Proofs of Their Low Polynomial Complexity and High Exactness

Mathematics
The mathematical side of applied problems in multiple subject areas (biology, pattern recognition, etc.) is reduced to the problem of discrete optimization in the following mathematical method.
Konstantin Gorbunov, Vassily Lyubetsky
doaj   +1 more source

Current Tracking Adaptive Control of Brushless DC Motors

International Journal of Adaptive Control and Signal Processing, EarlyView.
In this paper, the current tracking for Brushless Direct Current motors is approached considering uncertainty in the parameters of the motor's model. An adaptive control scheme to compensate electrical parameters uncertainty is proposed without requiring any knowledge of the mechanical parameters.
Fernanda Ramos‐García, Axel Coronado‐Andrade, Gerardo Espinosa‐Pérez, Luis Alvarez‐Icaza   +3 more
wiley   +1 more source

Simple High-Level Code for Cryptographic Arithmetic - With Proofs, Without Compromises

IEEE Symposium on Security and Privacy, 2019
We introduce a new approach for implementing cryptographic arithmetic in short high-level code with machine-checked proofs of functional correctness. We further demonstrate that simple partial evaluation is sufficient to transform into the fastest-known ...
Andres Erbsen, Jade Philipoom, Jason Gross, R. Sloan, A. Chlipala   +4 more
semanticscholar   +1 more source

A Robust Adaptive One‐Sample‐Ahead Preview Super‐Twisting Sliding Mode Controller

International Journal of Adaptive Control and Signal Processing, EarlyView.
Block Diagram of the Robust Adaptive One‐Sample‐Ahead Preview Super‐Twisting Sliding Mode Controller. ABSTRACT This article introduces a discrete‐time robust adaptive one‐sample‐ahead preview super‐twisting sliding mode controller. A stability analysis of the controller by Lyapunov criteria is developed to demonstrate its robustness in handling both ...
Guilherme Vieira Hollweg, Paulo Jefferson Dias de Oliveira Evald, Shivam Chaturvedi, Hilton Abilio Gründling, Rodrigo Varella Tambara, Wencong Su   +5 more
wiley   +1 more source

Evaluating the Efficiency of zk-SNARK, zk-STARK, and Bulletproof in Real-World Scenarios: A Benchmark Study

Information
This study builds on our previous systematic literature review (SLR) that assessed the applications and performance of zk-SNARK, zk-STARK, and Bulletproof non-interactive zero-knowledge proof (NIZKP) protocols. To address the identified research gaps, we
Mohammed El-Hajj, Bjorn Oude Roelink
doaj   +1 more source

Complexity Jumps In Multiagent Justification Logic Under Interacting Justifications [PDF]

, 2014
The Logic of Proofs, LP, and its successor, Justification Logic, is a refinement of the modal logic approach to epistemology in which proofs/justifications are taken into account.
Achilleos, Antonis
core  

The proof complexity of linear algebra

Annals of Pure and Applied Logic, 2003
The authors analyze the complexity of the concepts needed to prove the basic theorems of linear algebra. One of the important results obtained in this paper is that the Cayley-Hamilton theorem enjoys a feasible proof. The analysis is carried out by making use of three formal theories, each of which is carefully designed so as to examine the basic ...
Soltys, Michael, Cook, Stephen
openaire   +1 more source

Enabling Digital Continuity in Virtual Manufacturing for Eco‐Efficiency Assessment of Lightweight Structures by Means of a Domain‐Specific Structural Mechanics Language: Requirements, Idea and Proof of Concept

Advanced Engineering Materials, EarlyView.
This article presents a solver‐agnostic domain‐specific language (DSL) for computational structural mechanics that strengthens interoperability in virtual product development. Using a hierarchical data model, the DSL enables seamless exchange between diverse simulation tools and numerical methods.
Martin Rädel, Andreas Schuster, Felix Schoenitz, Jean Lefèvre   +3 more
wiley   +1 more source