Results 61 to 70 of about 94,999 (279)

Multiobjective Environmental Cleanup with Autonomous Surface Vehicle Fleets Using Multitask Multiagent Deep Reinforcement Learning

open access: yesAdvanced Intelligent Systems, EarlyView.
This study presents a multitask strategy for plastic cleanup with autonomous surface vehicles, combining exploration and cleaning phases. A two‐headed Deep Q‐Network shared by all agents is traineded via multiobjective reinforcement learning, producing a Pareto front of trade‐offs.
Dame Seck   +4 more
wiley   +1 more source

Sparsity oracle inequalities for the Lasso

open access: yes, 2007
This paper studies oracle properties of $\ell_1$-penalized least squares in nonparametric regression setting with random design. We show that the penalized least squares estimator satisfies sparsity oracle inequalities, i.e., bounds in terms of the ...
Bunea, Florentina   +2 more
core   +1 more source

Quantum Lazy Sampling and Game-Playing Proofs for Quantum Indifferentiability [PDF]

open access: yes, 2021
Game-playing proofs constitute a powerful framework for non-quantum cryptographic security arguments, most notably applied in the context of indifferentiability. An essential ingredient in such proofs is lazy sampling of random primitives.
Czajkowski, Jan   +3 more
core   +1 more source

Riemannian Geometry for the Classification of Brain States with Intracortical Brain Recordings

open access: yesAdvanced Intelligent Systems, EarlyView.
Geometric machine learning is applied to decode brain states from invasive intracortical neural recordings, extending Riemannian methods to the invasive regime where data is scarcer and less stationary. A Minimum Distance to Mean classifier on covariance manifolds uses geodesic distances to outperform convolutional neural networks while reducing ...
Arnau Marin‐Llobet   +9 more
wiley   +1 more source

Two improved content extraction signature schemes

open access: yes网络与信息安全学报, 2017
Motivated by the idea of batch signatures,two variants of content extraction signature schemes based on commit vector and RSA respectively were presented.In the proposed schemes,the efficiency of signing and verification were improved by unifying certain
Min WANG   +3 more
doaj   +3 more sources

Predictable arguments of knowledge [PDF]

open access: yes, 2017
We initiate a formal investigation on the power of predictability for argument of knowledge systems for NP. Specifically, we consider private-coin argument systems where the answer of the prover can be predicted, given the private randomness of the ...
B Barak   +29 more
core   +2 more sources

Does Accounting Scope 3 Emissions Improve Sustainable Business Outcomes? Evidence From the S&P 500 Technology Companies

open access: yesBusiness Strategy and the Environment, EarlyView.
ABSTRACT Corporate sustainability efforts increasingly emphasize Scope 3 emissions due to their substantial share of total corporate carbon footprints. However, reporting these emissions remains inconsistent, limiting transparency and comparability across firms.
Nuri C. Onat   +4 more
wiley   +1 more source

Quantum Security of a Compact Multi-Signature

open access: yesCryptography
With the rapid advances in quantum computing, quantum security is now an indispensable property for any cryptographic system. In this paper, we study how to prove the security of a complex cryptographic system in the quantum random oracle model. We first
Shaoquan Jiang
doaj   +1 more source

Cryptanalysis of a Lightweight Certificateless Signature Scheme for IIOT Environments

open access: yesIEEE Access, 2018
As an extremely significant cryptographic primitive, certificateless signature (CLS) schemes can provide message authentication with no use of traditional digital certificates.
Bo Zhang   +3 more
doaj   +1 more source

Security of discrete log cryptosystems in the random oracle and the generic model [PDF]

open access: yes, 1999
We introduce novel security proofs that use combinatorial counting arguments rather than reductions to the discrete logarithm or to the Diffie-Hellman problem. Our security results are sharp and clean with no polynomial reduction times involved.
Jakobsson, Markus, Schnorr, Claus Peter
core  

Home - About - Disclaimer - Privacy