Results 101 to 110 of about 73,753 (309)
Advanced Science, EarlyView.Biological rhythms coordinate physiology, from genes to behavior. Study of circadian rhythms in brain tissue is constrained by limited throughput and spatial and temporal information quality. A new platform for high‐throughput, long‐term multiplexed fluorescent live imaging of circadian rhythms in brain slices is introduced.
Marco Ferrari +3 more
wiley +1 more source
A polynomial time approximation algorithm for dynamic storage allocation
, 1991 We use an on-line algorithm for coloring interval graphs to construct a polynomial time approximation algorithm WIC for Dynamic Storage Allocation. The performance ratio for WIC is at most six; the best previous upper bound on the performance ratio for a
H.A. Kierstead, Kierstead, H.A.
core +1 more source
Engineering Neuronal Network Connectivity Through Precise and Scalable Electrical Modulation
Advanced Science, EarlyView.This study presents a scalable all‐electrical method for precise neuronal‐circuit reconfiguration based on high‐density microelectrode arrays. By employing biologically inspired plasticity rules, targeted connectivity changes were successfully induced and quantified across diverse neuronal preparations.
Sreedhar S. Kumar +10 more
wiley +1 more source
Advanced Science, EarlyView.A novel optical thermometer exploits the rare UV emission of Yb2+ ions in a SrB4O7 host, enabling highly sensitive, non‐contact temperature measurements from 80 to 420 K. The applied multiple linear regression (MLR) analysis results in a multiple increase in the resulting temperature sensitivity.
Fang Zhao +6 more
wiley +1 more source
Symmetric Encryption Algorithms in a Polynomial Residue Number System
Journal of Applied MathematicsIn this paper, we develop the theoretical provisions of symmetric cryptographic algorithms based on the polynomial residue number system for the first time. The main feature of the proposed approach is that when reconstructing the polynomial based on the
I. Yakymenko +3 more
doaj +1 more source
On the exact polynomial time algorithm for a special class of bimatrix game
Lietuvos Matematikos Rinkinys, 2013 The Strategy Elimination (SE) algorithm was proposed in [2] and implemented by a sequence of Linear Programming (LP) problems. In this paper an efficient explicit solution is developed and the convergence to the Nash Equilibrium is proven. Keywords: game
Jonas Mockus, Martynas Sabaliauskas
doaj +1 more source
Evaluating a weighted graph polynomial for graphs of bounded tree-width
, 2009 We show that for any $k$ there is a polynomial time algorithm to evaluate the weighted graph polynomial $U$ of any graph with tree-width at most $k$ at any point.
Noble, Steven, Noble, S D
core
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP [PDF]
, 2013 2-Opt is probably the most basic local search heuristic for the TSP. This heuristic achieves amazingly good results on “real world” Euclidean instances both with respect to running time and approximation ratio.
Matthias Englert +5 more
core +1 more source
Field‐Frustrated Cooperative Distortions: Suppressing Jahn‐Teller Ordering via Microwave Annealing
Advanced Science, EarlyView.Microwave annealing decouples local Jahn‐Teller distortions from long‐range cooperative ordering in CuFe2O4, stabilizing a metastable cubic phase that remains locally distorted yet globally symmetry‐frustrated. Synchrotron XRD, PDF, XPS, and in situ thermal cycling reveal how non‐equilibrium MW‐phonon interactions suppress cooperative orbital‐lattice ...
Daryoosh Vashaee, Kelvin Dsouza
wiley +1 more source
IEEE AccessThis paper presents a scheme that is designed for the effective implementation of lattice reduction for polynomial matrices within the list-decoding algorithm that is applied to the binary Goppa codes.
Ki-Soon Yu, Dae-Woon Lim
doaj +1 more source