Results 81 to 90 of about 1,864,097 (296)

Parameterized Complexity of PCA (Invited Talk) [PDF]

open access: yes, 2020
We discuss some recent progress in the study of Principal Component Analysis (PCA) from the perspective of Parameterized ...
Fomin, Fedor   +4 more
core   +1 more source

A Simple Descriptor for Solid‐State Ionic Conductors Across Chemistries

open access: yesAdvanced Materials, EarlyView.
Researchers develop a simple and transferable descriptor, distance contraction, for solid‐state ion migration across Li‐, Na‐, K‐, and Mg‐ion conductors and diverse anion chemistries. By capturing the maximum local contraction experienced by the migrating ion, the descriptor enables rapid materials screening and unifies diverse ion‐transport mechanisms.
Ramanuja Srinivasan Saravanan   +4 more
wiley   +1 more source

Is FFT Fast Enough for Beyond 5G Communications? A Throughput-Complexity Analysis for OFDM Signals

open access: yesIEEE Access, 2022
In this paper, we study the impact of computational complexity on the throughput limits of the fast Fourier transform (FFT) algorithm for orthogonal frequency division multiplexing (OFDM) waveforms.
Saulo Queiroz   +2 more
doaj   +1 more source

Monolithically 3D‐Printed Spectral‐Spatial Meta‐Authenticators

open access: yesAdvanced Materials, EarlyView.
A single height map printed in a low‐index resin by two‐photon lithography encodes multiple visible wavelengths in one metasurface without any polarization optics. A fabrication‐aware optimization folds the printable height levels into the design, so the device is printed as optimized.
Cherry Park   +3 more
wiley   +1 more source

The Burning Number of Directed Graphs: Bounds and Computational Complexity

open access: yesTheory and Applications of Graphs, 2020
The burning number of a graph was recently introduced by Bonato et al. Although they mention that the burning number generalizes naturally to directed graphs, no further research on this has been done. Here, we introduce graph burning for directed graphs,
Remie Janssen
doaj   +1 more source

Phase Diagrams Enable Solid‐State Battery Design

open access: yesAdvanced Materials Interfaces, EarlyView.
Batteries are non‐equilibrium devices with inherent thermodynamic driving forces to react at interfaces, regardless of kinetics or operating conditions. Chemical potential mismatches across interfaces are dissipated via interfacial reactions. In this work, it is illustrated how phase diagrams and chemical potential maps predict degradation pathways but
Nathaniel L. Skeele, Matthias T. Agne
wiley   +1 more source

Multimodal Haptic Display Integrating Texture, Softness, and Thermal Rendering for Active Touch

open access: yesAdvanced Materials Technologies, EarlyView.
SensaSurf is a haptic display capable of rendering four perceptually salient surface properties (roughness, friction, softness, and temperature) during active exploration with bare fingertips. ABSTRACT Touch allows humans to perceive fundamental cues, such as roughness, friction, softness, and temperature, that define how surfaces feel.
Haewon Jeong   +3 more
wiley   +1 more source

Integer Programming in Parameterized Complexity: Three Miniatures [PDF]

open access: yes, 2019
Powerful results from the theory of integer programming have recently led to substantial advances in parameterized complexity. However, our perception is that, except for Lenstra's algorithm for solving integer linear programming in fixed dimension ...
Koutecký, Martin   +2 more
core   +1 more source

Identifying Physical Interactions in Contact‐Based Robot Manipulation for Learning from Demonstration

open access: yesAdvanced Robotics Research, EarlyView.
Robots can learn manipulation tasks from human demonstrations. This work proposes a versatile method to identify the physical interactions that occur in a demonstration, such as sequences of different contacts and interactions with mechanical constraints.
Alex Harm Gert‐Jan Overbeek   +3 more
wiley   +1 more source

Pattern-Guided k-Anonymity

open access: yesAlgorithms, 2013
We suggest a user-oriented approach to combinatorial data anonymization. A data matrix is called k-anonymous if every row appears at least k times—the goal of the NP-hard k-ANONYMITY problem then is to make a given matrix k-anonymous by suppressing ...
Rolf Niedermeier   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy