Results 91 to 100 of about 176,338 (220)

Israel's Netanyahu Trap

open access: yesMiddle East Policy, Volume 33, Issue 3, Autumn (Fall) 2026.
Abstract On February 28, 2026, a major regional war broke out involving the United States, Israel, and Iran. While the theory of structural realism considers this conflict the product of shifting power dynamics, this article argues that it is better explained by what we term diversionary rhetorical entrapment.
Bulent Aras
wiley   +1 more source

Sparse Minimum Redundancy Maximum Relevance for Feature Selection

open access: yesScandinavian Journal of Statistics, Volume 53, Issue 3, Page 1134-1151, September 2026.
ABSTRACT We propose a feature screening method that integrates both feature–feature and feature–target relationships. Inactive features are identified via a penalized minimum Redundancy Maximum Relevance (mRMR) procedure, which is the continuous version of the classical mRMR penalized by a non‐convex regularizer, and where the parameters estimated as ...
Peter Naylor   +3 more
wiley   +1 more source

Boolean dominated MV-algebras

open access: yes, 2005
In this paper the authors study an obvious generalization of the hyperarchimedian MV-algebras: boolean dominated MV-algebras. Particularly they point out the wide difference between the class of the hyperarchimedian MV-algebras and the class of the ...
LETTIERI, ADA, BELLUCE L. P
core   +1 more source

Soft binary piecewise intersection operation

open access: yesVietnam Journal of Science, Technology and Engineering
Soft set theory has emerged as a novel approach to modelling uncertainty, addressing a wide range of theoretical and practical problems. In this study, we define a new soft set operation called “soft binary piecewise intersection operation” and explore ...
Aslıhan Sezgin   +2 more
doaj   +1 more source

Nonamenable subforests of multi‐ended quasi‐pmp graphs

open access: yesProceedings of the London Mathematical Society, Volume 133, Issue 3, September 2026.
Abstract We prove the a.e. nonamenability of locally finite quasi‐pmp Borel graphs whose every component admits at least three nonvanishing ends with respect to the underlying Radon–Nikodym cocycle. We witness their nonamenability by constructing Borel subforests with at least three nonvanishing ends per component, and then applying Tserunyan and ...
Ruiyuan Chen   +2 more
wiley   +1 more source

Representability is not decidable for finite relation algebras [PDF]

open access: yes, 2001
Published ...
Hirsch, R, Hodkinson, I
core   +1 more source

An Algebraic Framework for Boolean Vector Spaces Over Almost Distributive Lattices

open access: yesJournal of Mathematics
This paper establishes a systematic study of Boolean vector spaces over relatively complemented almost distributive lattices. Motivated by the classical theory of Boolean vector spaces, we generalize these notions to a broader algebraic framework in ...
Ramesh Sirisetti   +2 more
doaj   +1 more source

A New Extended Soft Intersection Set to M,N-SI Implicative Fitters of BL-Algebras

open access: yesThe Scientific World Journal, 2014
Molodtsov’s soft set theory provides a general mathematical framework for dealing with uncertainty. The concepts of (M,N)-SI implicative (Boolean) filters of BL-algebras are introduced. Some good examples are explored.
Jianming Zhan, Qi Liu, Hee Sik Kim
doaj   +1 more source

Simple Harmonic Motion Analysis of Elastic Structures Using Hamiltonian Simulation via Quantum Singular Value Transformation

open access: yesInternational Journal for Numerical Methods in Engineering, Volume 127, Issue 16, 30 August 2026.
ABSTRACT This study proposes a quantum computing algorithm for dynamic structural analysis, assuming the use of quantum computers. Specifically, we apply a quantum algorithm known as Hamiltonian Simulation (HS), which calculates the time evolution of the Schrödinger equation with time‐independent coefficients, to the equations of motion governing the ...
Koya Wagatsuma   +2 more
wiley   +1 more source

Boolean Partition Algebras [PDF]

open access: yes, 2013
A Boolean partition algebra is a pair $(B,F)$ where $B$ is a Boolean algebra and $F$ is a filter on the semilattice of partitions of $B$ where $\bigcup F=B\setminus\{0\}$.
Van Name, Joseph   +1 more
core  

Home - About - Disclaimer - Privacy