Results 51 to 60 of about 1,828,404 (296)

Modified Kleene Star Algorithm Using Max-Plus Algebra and Its Application in the Railroad Scheduling Graphical User Interface

open access: yesComputation, 2023
In max-plus algebra, some algorithms for determining the eigenvector of irreducible matrices are the power algorithm and the Kleene star algorithm. In this research, a modified Kleene star algorithm will be discussed to compensate for the disadvantages ...
Ema Carnia   +4 more
doaj   +1 more source

Q‐LEAP: Millisecond Hyperdimensional Optimization for Full‐Spectrum Optical Metamaterials

open access: yesAdvanced Science, EarlyView.
Q‐LEAP integrates physics‐informed residual machine learning with factorization‐machine‐encoded quantum annealing to design full‐spectrum optical metamaterials. It explores a 2108 design space and, in a single 2.56 ms annealing step, reaches 85.83% of the theoretical FoM limit, enabling selective 5‐8 µm emission with 3–5 and 8–14 µm suppression and ∼40×
Zikang Guo   +3 more
wiley   +1 more source

A 3-manifold complexity via immersed surfaces [PDF]

open access: yes, 2008
We define an invariant, which we call surface-complexity, of closed 3-manifolds by means of Dehn surfaces. The surface-complexity of a manifold is a natural number measuring how much the manifold is complicated.
GENNARO AMENDOLA, Amendola, Gennaro
core   +2 more sources

Beautiful the beauty—Dionne Brand’s Theory and Canisia Lubrin’s Voodoo Hypothesis

open access: yesCanada and Beyond, 2022
Against the reductive and the often universalizing poetics of much poetry and much theoretical discourse that abandons feelings from its rhetoric, the works of Dionne Brand’s Theory and Canisia Lubrin’s Voodoo Hypothesis promote layered, black and ...
Alexei Perry Cox
doaj   +1 more source

Teleological Explanation of Irreducible Complexity of the Biochemical Systems [PDF]

open access: yes, 2006
The main purpose of this article is a presentation of one of the subtheories included in the so‑called intelligent design theory – a concept of irreducible complexity of the biochemical systems.
Sagan, Dariusz
core  

Spatiotemporal Computational Meta‐Imager for Broadband Dual‐Layer Optical Convolution

open access: yesAdvanced Science, EarlyView.
A single‐layer polarization‐multiplexed meta‐imager achieves factorized dual‐layer broadband convolution via spatiotemporal kernel decomposition. Fixed Bessel‐vortex bases and time‐sequential liquid‐crystal modulation deliver tunable signed weights and in‐situ fabrication‐error compensation. Experiments verify improved classification performance across
Mengguang Wang   +6 more
wiley   +1 more source

N-Term Karatsuba Algorithm and its Application to Multiplier Designs for Special Trinomials

open access: yesIEEE Access, 2018
In this paper, we propose a new type of non-recursive Mastrovito multiplier for GF(2m) using an n-term Karatsuba algorithm (KA), where GF(2m) is defined by an irreducible trinomial, xm+xk +1, m = nk.
Yin Li, Yu Zhang, Xiaoli Guo, Chuanda Qi
doaj   +1 more source

A pedagogical derivation of dynamical susceptibilities

open access: yesCondensed Matter Physics, 2021
Dynamical two-particle susceptibilites are important for a wide range of different experiments in condensed-matter physics and beyond. Nevertheless, most textbooks avoid describing how to derive such response functions, perhaps because they are viewed as
R.D. Nesselrodt, J.K. Freericks
doaj   +1 more source

STRIDE: A Sequencing Depth Robust Metric for Sparse Chromosome Conformation Capture Data Comparison

open access: yesAdvanced Science, EarlyView.
A mean first passage time (MFPT)‐based representation transforms sparse Hi‐C contact maps into robust topological representations, preserving biologically meaningful chromatin features and facilitating robust analysis of TADs, chromatin loops, differential chromatin contacts, and sparse single‐cell Hi‐C data.
Bingxiang Xu   +4 more
wiley   +1 more source

Low Space Complexity $GF(2^m)$ Multiplier for Trinomials Using $n$ -Term Karatsuba Algorithm

open access: yesIEEE Access, 2019
We propose bit-parallel GF(2m) multipliers for irreducible trinomials using an n-term Karatsuba algorithm and Mastrovito approach, which are generalizations of the newly proposed multiplication scheme for a specific trinomial.
Sun-Mi Park   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy