Diagonally Implicit Symplectic Runge-Kutta Methods with High Algebraic and Dispersion Order
The numerical integration of Hamiltonian systems with oscillating solutions is considered in this paper. A diagonally implicit symplectic nine-stages Runge-Kutta method with algebraic order 6 and dispersion order 8 is presented.
Y. H. Cong, C. X. Jiang
doaj +1 more source
Distinct Biotypes of Visual Perception in Major Depressive Disorder
In a discover dataset (272 acute MDD patients), this work identifies a novel depression biotype characterized by impaired visual motion perception, using machine learning clustering. An independent dataset confirms the robustness of this biotype through cross‐validation and demonstrates its generalizability.
Zhuoran Cai +13 more
wiley +1 more source
Reliability assessment method of distribution system based on algebraic model
In order to solve the shortcomings of existing distribution system reliability dependent simulation methods and imprecise optimization methods, a new and efficient distribution system reliability evaluation method based on algebraic model is proposed in ...
YU Wei +5 more
doaj +1 more source
Modeling and Verification of 1/f Noise Mechanisms in FAPbBr3 Single‐Crystal X‐Ray Detectors
We demonstratethat surface‐trap‐induced carrier number fluctuations are the dominantmechanism in FAPbBr3 Schottky devices, a conclusion supported by thedistinct defect profiles revealed by Drive‐Level Capacitance Profiling (DLCP). Throughnoise contribution decomposition, it is found that the 1/f noise of thedetector is the key noise source affecting ...
Zhongyu Yang +6 more
wiley +1 more source
Computational Characterization of the Multiplication Operation of Octonions via Algebraic Approaches
A succinct and systematic form of multiplication for any arbitrary pairs of octonions is devised. A typical expression of multiplication for any pair of octonions involves 64 terms, which, from the computational and theoretical aspect, is too cumbersome.
Ray-Ming Chen
doaj +1 more source
Finite automata over algebraic structures: models and some methods of analysis [PDF]
In this paper some results of research in two new trends of finite automata theory are presented. For understanding the value and the aim of these researches some short retrospective analysis of development of finite automata theory is given.
Volodymyr V. Skobelev +1 more
doaj
Low‐Power Control Of Resistance Switching Transitions in First‐Order Memristors
Joule losses are a serious concern in modern integrated circuit design. In this regard, minimizing the energy necessary for programming memristors should be handled with care. This manuscript presents an optimal control framework, allowing to derive energy‐efficient programming voltage protocols for resistance switching devices. Following this approach,
Valeriy A. Slipko +3 more
wiley +1 more source
Direct Approaches for Representations of Various Algebraic Domains via Closure Spaces
In this paper, F-augmented closure spaces are generalized to F-closure spaces, and the concept of F-closed sets are introduced. Properties of their ordered structures are investigated.
Guojun Wu, Luoshan Xu
doaj +1 more source
Can Computer Algebra be Liberated from its Algebraic Yoke ?
So far, the scope of computer algebra has been needlessly restricted to exact algebraic methods. Its possible extension to approximate analytical methods is discussed.
Barrere, R.
core +1 more source
SPICE‐Compatible Compact Modeling of Cuprate‐Based Memristors Across a Wide Temperature Range
A physics‐guided compact model for YBCO memristors is introduced, incorporating carrier trapping, field‐induced detrapping, and a differential balance equation to describe their switching dynamics. The model is compared with experiments and implemented in LTspice, allowing realistic circuit‐level simulations.
Thomas Günkel +6 more
wiley +1 more source

