Results 91 to 100 of about 103,432 (283)
Quantum Algorithms for Tree Isomorphism and State Symmetrization [PDF]
The graph isomorphism problem is theoretically interesting and also has many practical applications. The best known classical algorithms for graph isomorphism all run in time super-polynomial in the size of the graph in the worst case.
Rosenbaum, David
core
Compliant Pneumatic Feet with Real‐Time Stiffness Adaptation for Humanoid Locomotion
A compliant pneumatic foot with real‐time variable stiffness enables humanoid robots to adapt to changing terrains. Using onboard vision and pressure control, the foot modulates stiffness within each gait cycle, reducing impact forces and improving balance. The design, cast in soft silicone with embedded air chambers and Kevlar wrapping, offers durable,
Irene Frizza +3 more
wiley +1 more source
Superposition Attacks on Pseudorandom Schemes Based on Two or Less Permutations
We study quantum superposition attacks against permutation-based pseudorandom cryptographic schemes. We first extend Kuwakado and Morii’s attack against the Even–Mansour cipher and exhibit key recovery attacks against a large class of pseudorandom ...
Shaoxuan Zhang, Chun Guo, Qingju Wang
doaj +1 more source
This study explores how information processing is distributed between brains and bodies through a codesign approach. Using the “backpropagation through soft body” framework, brain–body coupling agents are developed and analyzed across several tasks in which output is generated through the agents’ physical dynamics.
Hiroki Tomioka +3 more
wiley +1 more source
Novel Image Encryption Scheme Based on Chebyshev Polynomial and Duffing Map
We present a novel image encryption algorithm using Chebyshev polynomial based on permutation and substitution and Duffing map based on substitution.
Borislav Stoyanov, Krasimir Kordov
doaj +1 more source
Grid classes and the Fibonacci dichotomy for restricted permutations
We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of length n in a ...
Huczynska, Sophie, Vatter, Vincent
core
Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies [PDF]
Synchronous Context-Free Grammars (SCFGs), also known as syntax-directed translation schemata, are unlike context-free grammars in that they do not have a binary normal form. In general, parsing with SCFGs takes space and time polynomial in the length of
Crescenzi, Pierluigi +4 more
core
On the difference between permutation polynomials
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nurdagül Anbar +5 more
openaire +5 more sources
This article explores what drives households to adopt solar PV and battery systems in South East Queensland. Using hybrid discrete choice experiments, it reveals distinct adopter profiles and highlights cost, system size, and energy independence as key motivators.
Mohammad Alipour +3 more
wiley +1 more source
Linear complexity of two classes of optimal sets frequency-hopping sequences
By using a type of permutation polynomials which were different from power permutations,the two classes of frequency-hopping sequence sets with low linear complexity was transformed into the ones with high linear complexity.The exact values of linear ...
Jun-tao GAO +3 more
doaj

