Results 151 to 160 of about 1,864,097 (296)

Dimple‐Encoded Reprogrammable Origami

open access: yesAdvanced Science, EarlyView.
Local snap‐through of bistable dimples turns flat elastic sheets into reprogrammable origami structures. Interaction‐guided dimple arrays act as angle‐programmable hinge bands, enabling one sheet to morph into distinct polygonal and three‐dimensional configurations while retaining stable shapes for deployable and protective functions.
Qun Zhang   +6 more
wiley   +1 more source

Efficient Cholesteric Liquid Crystal Waveguide Polarizing Splitters for High‐Sensitivity Chip‐Scale Atomic Magnetometry

open access: yesAdvanced Science, EarlyView.
An integrated polarimetry architecture based on a cholesteric liquid crystal waveguide polarization splitter overcomes the volumetric bottleneck in chip‐scale atomic magnetometers. By leveraging Bragg‐selective reflection and total‐internal‐reflection‐induced helicity inversion, this ultrathin device enables efficient circular polarization splitting ...
Zhibo Cui   +9 more
wiley   +1 more source

Evaluating the Interplay of Model Complexity and Parameter Diversity in Fuzzy Logic-Based Electric Vehicle Regenerative Braking

open access: yesEnergies
As electric vehicles (EVs) become increasingly popular worldwide, optimizing energy regeneration and overall driving range remains critically important.
Daghan Dogan
doaj   +1 more source

Parameterized Complexity of Factorization Problems

open access: yesDiscrete Mathematics & Theoretical Computer Science
We study the parameterized complexity of the following factorization problem: given elements $a,a_1, \ldots, a_m$ of a monoid and a parameter $k$, can $a$ be written as the product of at most (or exactly) $k$ elements from $a_1, \ldots, a_m$. Several new upper bounds and fpt-equivalences with more restricted problems (subset sum and knapsack) are shown.
Markus Lohrey, Andreas Rosowski
openaire   +2 more sources

A Thickness‐Invariant Origami Robot With Integrated Actuation and Multimodal Locomotion

open access: yesAdvanced Science, EarlyView.
A thickness‐invariant variation on the Yoshimura origami pattern is used as the basis of a robot, allowing power, actuation, and control systems to be embedded within the thickened panels of the pattern. The robot uses multiple kinematic branches to achieve distinct modes of locomotion, such as walking, running, galloping, and turning. ABSTRACT Origami
Davis Wing   +4 more
wiley   +1 more source

A Survey on Parameterized Complexity and SAT

open access: yes, 2015
In this talk I will discuss basic concepts of parameterized complexity (such as fixed-parameter tractability, reductions, hardness, and kernelization) and survey parameterized complexity results related to satisfiability (SAT).
Szeider, Stefan
core   +2 more sources

RNA inverse folding can be solved in linear time for structures without isolated stacks or base pairs

open access: yesAlgorithms for Molecular Biology
Inverse folding is a classic instance of negative RNA design which consists in finding a sequence that uniquely folds into a target secondary structure with respect to energy minimization. A breakthrough result of Bonnet et al. shows that, even in simple
Théo Boury   +3 more
doaj   +1 more source

14‐3‐3γ Protects Against Postoperative Cognitive Dysfunction by Regulating Tau Thr205 Phosphorylation and Synaptic Integrity

open access: yesAdvanced Science, EarlyView.
Integrative multi‐cohort analyses identify 14‐3‐3γ as a biomarker and regulator of cognitive vulnerability. Experimental studies show that 14‐3‐3γ loss is associated with Tau Thr205 phosphorylation, synaptic dysfunction, and cognitive impairment, while genetic overexpression or pharmacological stabilization of 14‐3‐3γ confers protective effects in ...
Shouqiang Zhu   +5 more
wiley   +1 more source

New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041)

open access: yes, 2019
This report documents the program and the outcomes of Dagstuhl Seminar 19041 "New Horizons in Parameterized Complexity". Parameterized Complexity is celebrating its 30th birthday in 2019.
Fomin, Fedor V.   +3 more
core   +1 more source

Parameterized Complexity of Vehicle Routing

open access: yesCoRR
The Vehicle Routing Problem (VRP) is a popular generalization of the Traveling Salesperson Problem. Instead of one salesperson traversing the entire weighted, undirected graph $G$, there are $k$ vehicles available to jointly cover the set of clients $C \subseteq V(G)$.
Michelle Döring   +8 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy