Results 51 to 60 of about 524 (199)
Variable‐Range Hopping Conduction in Amorphous, Non‐Stoichiometric Gallium Oxide
The combination of experimental evidence, ab‐initio DOS calculations and quantitative modeling by kinetic Monte Carlo simulations reveals: Variable‐range hopping (VRH) is the dominant electron conduction mechanism in a‐GaOx (x = 0.8 to 1.0), even at room temperature, which leads to a new, fundamental understanding of a‐GaOx‐based electronic devices ...
Philipp Hein +7 more
wiley +1 more source
Marin Mersenne’s mathematical contributions helped paved the way for advances in mathematics. In this article, his life is not only depicted but his mathematical intellect is highlighted through his achievements.
Fryer, Joseph, Detro, Casey
core
This paper introduces an axiomatic approach in the theory of energy dissipation in Hilbert envelopes on motion waveforms emanating from various vibrating dynamical systems. A Hilbert envelope is a curve tangent to peak points on a motion waveform.
Tharaka Liyanage, James F. Peters
doaj +1 more source
Computing character degrees via a Galois connection [PDF]
In a previous paper, the second author established that, given finite fields ...
Mark L. Lewis , John K. McVey
doaj
A characterization of some finite simple groups by their character codegrees
Abstract Let G$G$ be a finite group and let χ$\chi$ be a complex irreducible character of G$G$. The codegree of χ$\chi$ is defined by cod(χ)=|G:ker(χ)|/χ(1)$\textrm {cod}(\chi)=|G:\textrm {ker}(\chi)|/\chi (1)$, where ker(χ)$\textrm {ker}(\chi)$ is the kernel of χ$\chi$.
Hung P. Tong‐Viet
wiley +1 more source
Batched ranged random integer generation
Summary Pseudorandom values are often generated as 64‐bit binary words. These random words need to be converted into ranged values without statistical bias. We present an efficient algorithm to generate multiple independent uniformly‐random bounded integers from a single uniformly‐random binary word, without any bias.
Nevin Brackett‐Rozinsky, Daniel Lemire
wiley +1 more source
This paper proposes an improved group target tracking algorithm based on rigid‐body similarity model and measurement fusion, implemented across different random finite set filtering frameworks. The method outperforms traditional VLFM algorithms in the GMPHD framework and demonstrates robustness against varying clutter densities in the PMBM framework ...
Kai Chang +4 more
wiley +1 more source
Perfect and Mersenne Numbers [PDF]
U ovom radu proučavamo Mersenneove i savršene brojeve. Kažemo da je prirodan broj N savršen ako je σ(N) = 2N, gdje je σ(N) suma pravih djelitelja broja N.
Patković, Kristina
core
Weakly subnormal subgroups and variations of the Baer–Suzuki theorem
Abstract A subgroup R$R$ of a finite group G$G$ is weakly subnormal in G$G$ if R$R$ is not subnormal in G$G$ but it is subnormal in every proper overgroup of R$R$ in G$G$. In this paper, we first classify all finite groups G$G$ that contains a weakly subnormal p$p$‐subgroup for some prime p$p$.
Robert M. Guralnick +2 more
wiley +1 more source
This research work presents a novel secured spatial steganography algorithm consisting of three stages. In the first stage, a secret message is divided into three parts, each is encrypted using a tan logistic map encryption key with a unique seed value.
Wassim Alexan +5 more
wiley +1 more source

