Results 11 to 20 of about 53,268 (175)
An ant colony genetic fusion routing algorithm based on soft define network
IET Networks, EarlyView., 2022 Abstract Aiming at the problem that there are many paths in data forwarding in soft define network (SDN) network, and the optimal path is difficult to find, combined with the advantages of ant colony algorithm and Genetic algorithm (GA), a routing control strategy based on the ant colony genetic fusion algorithm is proposed.
Kaixin Zhao, Yong Wei, Yang Zhang
wiley +1 more source
Advanced Intelligent Discovery, EarlyView.This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Yiming Ren, Guo‐Wei Wei
wiley +1 more source
Desingularization in Computational Applications and Experiments [PDF]
, 2013 After briefly recalling some computational aspects of blowing up and of representation of resolution data common to a wide range of desingularization algorithms (in the general case as well as in special cases like surfaces or binomial varieties), we ...
Frühbis-Krüger, Anne
core
Revealing Protein–Protein Interactions Using a Graph Theory‐Augmented Deep Learning Approach
Advanced Intelligent Discovery, EarlyView.This study presents a fast, cost‐efficient approach for classifying protein–protein interactions by integrating graph‐theory parametrization with deep learning (DL). Multiscale features extracted from graph‐encoded polarized‐light microscopy (PLM) images enable accurate prediction of binding strengths.
Bahar Dadfar +5 more
wiley +1 more source
Review of Memristors for In‐Memory Computing and Spiking Neural Networks
Advanced Intelligent Systems, EarlyView.Memristors uniquely enable energy‐efficient, brain‐inspired computing by acting as both memory and synaptic elements. This review highlights their physical mechanisms, integration in crossbar arrays, and role in spiking neural networks. Key challenges, including variability, relaxation, and stochastic switching, are discussed, alongside emerging ...
Mostafa Shooshtari +2 more
wiley +1 more source
Formalized proof, computation, and the construction problem in algebraic geometry [PDF]
, 2004 An informal discussion of how the construction problem in algebraic geometry motivates the search for formal proof methods. Also includes a brief discussion of my own progress up to now, which concerns the formalization of category theory within a ZFC ...
Simpson, Carlos T.
core
An Einstein-Bianchi system for Smooth Lattice General Relativity. I. The Schwarzschild spacetime
, 2011 The second Bianchi identity can be recast as an evolution equation for the Riemann curvatures. Here we will report on such a system for a vacuum static spherically symmetric spacetime. This is the first of two papers.
Brewin, Leo
core +1 more source
Risk‐aware safe reinforcement learning for control of stochastic linear systems
Asian Journal of Control, EarlyView.Abstract This paper presents a risk‐aware safe reinforcement learning (RL) control design for stochastic discrete‐time linear systems. Rather than using a safety certifier to myopically intervene with the RL controller, a risk‐informed safe controller is also learned besides the RL controller, and the RL and safe controllers are combined together ...
Babak Esmaeili +2 more
wiley +1 more source
Asian Journal of Control, EarlyView.Abstract The linear‐quadratic regulator (LQR) problem of optimal control of an uncertain discrete‐time linear system (DTLS) is revisited in this paper from the perspective of Tikhonov regularization. We show that an optimally chosen regularization parameter reduces, compared to the classical LQR, the values of a scalar error function, as well as the ...
Fernando Pazos, Amit Bhaya
wiley +1 more source
Isogenies of Elliptic Curves: A Computational Approach [PDF]
, 2009 Isogenies, the mappings of elliptic curves, have become a useful tool in cryptology. These mathematical objects have been proposed for use in computing pairings, constructing hash functions and random number generators, and analyzing the reducibility of ...
Shumow, Daniel
core +2 more sources