Results 91 to 100 of about 11,198,718 (212)

A Multi‐Scale Machine Learning Framework for the Inverse Design of High Entropy Alloys

Advanced Engineering Materials, EarlyView.
High‐entropy alloys offer vast potential for various applications, including electrocatalysis; however, their compositional complexity challenges conventional screening. We introduce an inverse‐design framework combining two neural networks to determine optimal compositions and reconstruct nanoparticle geometry from targeted properties and conventional
Mikael Takoutsin, Marta Campolucci, Nicolas de Andrade Ishiki, Nathan Mirgot, Nadir Zhamantay, Frédéric Kanoufi, Jennifer Peron, Jean Charlety, Emiliano Fonda, Valérie Briois, Marco Faustini, Maria‐Letizia De Marco, Christine Goyhenex, Ovidiu Ersen, Hervé Bulou   +14 more
wiley   +1 more source

Comparing Two Multivariable Complexity Functions Using One-variable Complexity Classes [PDF]

The comparison of algorithms complexities is very important both in theory and in practice. When we compare algorithms complexities we need to compare complexity functions. Usually we use one-variable complexity functions.
Adina Magda FLOREA, Andrei Horia MOGOS
core  

A comparative study of game theoretic and evolutionary models for software agents

, 2004
Most of the existing work in the study of bargaining behaviour uses techniques from game theory. Game theoretic models for bargaining assume that players are perfectly rational and that this rationality in common knowledge.
Shaheen S. Fatima, Nicholas R. Jennings, Fatima, S., Michael Wooldridge, Jennings, NR, Jennings, N.R., Wooldridge, M, Wooldridge, M., Fatima, S   +8 more
core   +1 more source

Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs [PDF]

, 2018
In algorithmic graph theory, a classic open question is to determine the complexity of the Maximum Independent Set problem on Pt -free graphs, that is, on graphs not containing any induced path on t vertices.
Lokshtanov, Daniel, Tuza, Zsolt, van Leeuwen, Erik Jan, Marx, Dániel, Bacsó, Gábor, Pilipczuk, Marcin, van Leeuwen, E.J.   +6 more
core   +1 more source

Identity-Based Provable Data Possession with Designated Verifier from Lattices for Cloud Computing

Entropy
Provable data possession (PDP) is a technique that enables the verification of data integrity in cloud storage without the need to download the data. PDP schemes are generally categorized into public and private verification.
Mengdi Zhao, Huiyan Chen
doaj   +1 more source

Wearable Smart Patches on Sustainable Chitosan With Reversible Microbial Growth‐Inhibitory Properties

Advanced Functional Materials, EarlyView.
ABSTRACT Chitosan, a polysaccharide upcycled from biowaste, has long promised sustainable, biocompatible, and antimicrobial films and devices, an appeal reinforced by its recent regulatory recognition, with several chitosan‐based antibacterial dressings gaining clearance through the Food and Drug Administration's 510(k) pathway.
Jacopo Nicoletti, Kubra Kocak, Andrea Michel, Enrico Cavarzerani, Ali Raza, Petr Rohzin, Nouha Loudhaief, Saimir Frroku, Nicolò Baldovin, Hazrat Bilal, Alvise Perosa, Maurizio Selva, Flavio Rizzolio, Luca Sbuelz, Sabrina Tamburini, Domenico De Fazio, Giovanni Antonio Salvatore   +16 more
wiley   +1 more source

Fragile Complexity of Comparison-Based Algorithms [PDF]

, 2019
We initiate a study of algorithms with a focus on the computational complexity of individual elements, and introduce the fragile complexity of comparison-based algorithms as the maximal number of comparisons any individual element takes part in.
Jacob, Riko, Afshani, Peyman, Penschuck, Manuel, Bender, Michael A., Sitchinava, Nodari, Meyer, Ulrich, Fagerberg, Rolf, Hammer, David Mortan Grøne, Herman, Grzegorz, Jacob, Riko; id_orcid, Penschuck, Manuel; id_orcid, Kostitsyna, Irina, Svensson, Ola, Hammer, David, Sitchinavaz, Nodari, Kostitsyna, I Irina   +15 more
core   +2 more sources

High-Efficiency Multi-Standard Polynomial Multiplication Accelerator on RISC-V SoC for Post-Quantum Cryptography

IEEE Access
Number Theoretic Transform (NTT) enables speeding up polynomial multiplications, thereby accelerating the implementation of lattice-based post-quantum cryptography (PQC) algorithms.
Duc-Thuan Dam, Trong-Hung Nguyen, Thai-Ha Tran, Duc-Hung Le, Trong-Thuc Hoang, Cong-Kha Pham   +5 more
doaj   +1 more source

Implantable Ionic Memristors Based on Natural Polymer Heterojunctions

Advanced Functional Materials, EarlyView.
We report an implantable natural polymer‐based ionic memristor composed of hyaluronic acid, chitosan, and PDMS. The device achieved 98.94% accuracy in MNIST classification while reducing training time by 36.8% compared with a conventional artificial neural network (ANN).
Dong‐yup Lee, Byung Ik Park, Gihyeon Yim, Hyunjae Yoo, Sangjun Ma, Jundong Park, Jeong‐Yun Sun   +6 more
wiley   +1 more source

Fast Approximation Algorithms and Complexity Analysis for Design of Networked Systems

, 2019
Presented on November 18, 2019 at 11:00 a.m. in the Klaus Advanced Computing Building, Room 1116E.Yuhao Yi is a postdoctoral researcher in Computer Science at Rensselaer Polytechnic Institute (RPI).
Yi, Yuhao
core